Dmitrii Pasechnik : Publications

On the Lovász theta−number of almost regular graphs with application to Erdös−Rényi graphs

E. De Klerk‚ M.W. Newman‚ D.V. Pasechnik and R. Sotirov

In European Journal of Combinatorics. Vol. 30. Pages 879–888. 2009.

Preprint 2006−09−1476 at Optimization Online

Details about On the Lovász theta−number of almost regular graphs with application to Erdös−Rényi graphs | BibTeX data for On the Lovász theta−number of almost regular graphs with application to Erdös−Rényi graphs | DOI (10.1016/j.ejc.2008.07.022)

A characterization of the Petersen−type geometry of the McLaughlin group

B. Baumeister‚ A. A. Ivanov and D. V. Pasechnik

In Math. Proc. Cambridge Philos. Soc.. Vol. 128. No. 1. Pages 21–44. 2000.

Details about A characterization of the Petersen−type geometry of the McLaughlin group | BibTeX data for A characterization of the Petersen−type geometry of the McLaughlin group

A linear programming reformulation of the standard quadratic optimization problem

E. de Klerk and D. V Pasechnik

In Journal of Global Optimization. Vol. 37. Pages 75–84. 2007.

Details about A linear programming reformulation of the standard quadratic optimization problem | BibTeX data for A linear programming reformulation of the standard quadratic optimization problem | DOI (10.1007/s10898-006-9037-9)

A local characterization of the graphs of alternating forms and the graphs of quadratic forms over GF(2)

A. Munemasa‚ D. V. Pasechnik and S. V. Shpectorov

In Finite geometry and combinatorics (Deinze‚ 1992). Vol. 191 of London Math. Soc. Lecture Note Ser.. Pages 303–317. Cambridge Univ. Press, Cambridge. 1993.

Details about A local characterization of the graphs of alternating forms and the graphs of quadratic forms over GF(2) | BibTeX data for A local characterization of the graphs of alternating forms and the graphs of quadratic forms over GF(2)

A new family of extended generalized quadrangles

Del Fra‚ Alberto‚ Dmitrii V. Pasechnik and Antonio Pasini

In European J. Combin.. Vol. 18. No. 2. Pages 155–169. 1997.

Details about A new family of extended generalized quadrangles | BibTeX data for A new family of extended generalized quadrangles

A note on the stability number of an orthogonality graph

E. de Klerk and D. V Pasechnik

In European Journal of Combinatorics. Vol. 28. Pages 1971–1979. 2007.

arxiv.org e−print math.CO/0505038

Details about A note on the stability number of an orthogonality graph | BibTeX data for A note on the stability number of an orthogonality graph | DOI (10.1016/j.ejc.2006.08.011)

A GAP/Sage package for computation with coherent configurations

Dmitrii V. Pasechnik and Keshav Kini

In Proceedings of Mini−Workshop Exploiting Symmetry in Optimization. Vol. 7 of Oberwolfach Reports. Pages 2251−2253. European Math. Soc.. 2010.

Details about A GAP/Sage package for computation with coherent configurations | BibTeX data for A GAP/Sage package for computation with coherent configurations

A GAP package for computation with coherent configurations

Dmitrii V. Pasechnik and Keshav Kini

In Proceedings of ICMS 2010. Vol. 6327 of Lecture Notes in Computer Science. Pages 69−72. Springer−Verlag, Berlin. 2010.

Details about A GAP package for computation with coherent configurations | BibTeX data for A GAP package for computation with coherent configurations

Affine extensions of the Petersen graph and 2−arc−transitive graphs of girth 5

Dmitrii V. Pasechnik

In European J. Combin.. Vol. 13. No. 4. Pages 279–290. 1992.

Details about Affine extensions of the Petersen graph and 2−arc−transitive graphs of girth 5 | BibTeX data for Affine extensions of the Petersen graph and 2−arc−transitive graphs of girth 5

Algebraic combinatorics in mathematical chemistry II. Program implementation of the Weisfeiler−Leman algorithm

Luitpold Babel‚ Irina V. Chuvaeva‚ Mikhail Klin and Dmitrii V. Pasechnik

Preprint TUM−M9701‚ Arxiv.org e−print 1002.1921. 1997.

Details about Algebraic combinatorics in mathematical chemistry II. Program implementation of the Weisfeiler−Leman algorithm | BibTeX data for Algebraic combinatorics in mathematical chemistry II. Program implementation of the Weisfeiler−Leman algorithm

Approximation of the stability number of a graph via copositive programming

E. de Klerk and D. V. Pasechnik

In SIAM J. Optim.. Vol. 12. No. 4. Pages 875–892 (electronic). 2002.

Details about Approximation of the stability number of a graph via copositive programming | BibTeX data for Approximation of the stability number of a graph via copositive programming

Automorphisms of necklaces and sandpile groups

S. Duzhin and D.V. Pasechnik

In Notes of Scientific Seminars of the St.Petersburg Department of the Steklov Mathematical Institute. Vol. 421. Pages 81–93. 2014.

arXiv.org e−print 1304.2563

Details about Automorphisms of necklaces and sandpile groups | BibTeX data for Automorphisms of necklaces and sandpile groups | Download (pdf) of Automorphisms of necklaces and sandpile groups

Book drawings of complete bipartite graphs

E. de Klerk‚ D. V. Pasechnik and G. Salazar

In Discrete Applied Mathematics. Vol. 167. Pages 80–93. 2014.

arXiv.org e−print math 1210.2918

Details about Book drawings of complete bipartite graphs | BibTeX data for Book drawings of complete bipartite graphs | DOI (10.1016/j.dam.2013.11.001)

Bounding the Betti numbers and computing the Euler−Poincare characteristic of semi−algebraic sets defined by partly quadratic systems of polynomials

S. Basu‚ D.V. Pasechnik and M.−F. Roy

In Journal of European Mathematical Society. Vol. 12. Pages 529–553. 2010.

arXiv.org preprint math.AG/0708.3522

Details about Bounding the Betti numbers and computing the Euler−Poincare characteristic of semi−algebraic sets defined by partly quadratic systems of polynomials | BibTeX data for Bounding the Betti numbers and computing the Euler−Poincare characteristic of semi−algebraic sets defined by partly quadratic systems of polynomials | DOI (10.4171/JEMS/208)

Circulant matrices and sandpile groups of generalized de Bruijn graphs

Swee Hong Chan‚ H. Hollmann and D. V. Pasechnik

In Proceedings of EuroComb 2013. Vol. 16 of Publications of the Scuola Normale Superiore. 2013.

arXiv.org e−print arXiv:1312.2114

Details about Circulant matrices and sandpile groups of generalized de Bruijn graphs | BibTeX data for Circulant matrices and sandpile groups of generalized de Bruijn graphs

Classification of 2−quasi−invariant subsets

Leonid Brailovsky‚ Dmitrii V. Pasechnik and Cheryl E. Praeger

In Ars Combin.. Vol. 42. Pages 65–76. 1996.

Details about Classification of 2−quasi−invariant subsets | BibTeX data for Classification of 2−quasi−invariant subsets

Complexity of semi−algebraic proofs

Dima Grigoriev‚ Edward A. Hirsch and Dmitrii V. Pasechnik

In STACS 2002. Vol. 2285 of Lecture Notes in Comput. Sci.. Pages 419–430. Springer, Berlin. 2002.

Details about Complexity of semi−algebraic proofs | BibTeX data for Complexity of semi−algebraic proofs

Complexity of semialgebraic proofs

Dima Grigoriev‚ Edward A. Hirsch and Dmitrii V. Pasechnik

In Mosc. Math. J.. Vol. 2. No. 4. Pages 647–679‚ 805. 2002.

Dedicated to Yuri I. Manin on the occasion of his 65th birthday

Details about Complexity of semialgebraic proofs | BibTeX data for Complexity of semialgebraic proofs

Computing symmetry groups of polyhedra

D. Bremner‚ M. Dutour ́c‚Sikiri D.V. Pasechnik‚ T. Rehn and A. Schürmann

In LMS Journal of Computation and Mathematics. Vol. 17. Pages 565−581. 2014.

arXiv.org e−print math 1210.0206

Details about Computing symmetry groups of polyhedra | BibTeX data for Computing symmetry groups of polyhedra

Computing the nucleolus of weighted voting games

E. Elkind and D.V. Pasechnik

In Claire Mathieu, editor, Proceedings of ACM−SIAM Symposium on Discrete Algorithms (SODA'09). Pages 327–335. SIAM, New York. 2009.

Details about Computing the nucleolus of weighted voting games | BibTeX data for Computing the nucleolus of weighted voting games

Computing the Betti numbers of semi−algebraic sets defined by partly quadratic systems of polynomials

S. Basu‚ D.V. Pasechnik and M.−F. Roy

In Journal of Algebra. Vol. 321. Pages 2206–2229. 2009.

arXiv.org preprint math.GT/0806.3911

Details about Computing the Betti numbers of semi−algebraic sets defined by partly quadratic systems of polynomials | BibTeX data for Computing the Betti numbers of semi−algebraic sets defined by partly quadratic systems of polynomials | DOI (10.1016/j.jalgebra.2008.09.043)

Distance−transitive graphs of type q· q‚q and projective planes

Irene V. Chuvaeva and Dmitrii V. Pasechnik

In European J. Combin.. Vol. 11. No. 4. Pages 341–346. 1990.

Details about Distance−transitive graphs of type q· q‚q and projective planes | BibTeX data for Distance−transitive graphs of type q· q‚q and projective planes

Dual linear extensions of generalised quadrangles

Dmitrii V. Pasechnik

In European J. Combin.. Vol. 12. No. 6. Pages 541–548. 1991.

Details about Dual linear extensions of generalised quadrangles | BibTeX data for Dual linear extensions of generalised quadrangles

Dynamic Weighted Voting Games

E. Elkind‚ D.V. Pasechnik and Y. Zick

In Proceedings of AAMAS 2013. Pages 515–522. IFAAMAS. 2013.

Details about Dynamic Weighted Voting Games | BibTeX data for Dynamic Weighted Voting Games | Download (pdf) of Dynamic Weighted Voting Games

Exploiting group symmetry in truss topology optimization

Y.−Q. Bai‚ E. De Klerk‚ D.V. Pasechnik and R. Sotirov

In Optimization and Engineering. Vol. 10. Pages 331–349. 2009.

Preprint 2007−04−1639 at Optimization online

Details about Exploiting group symmetry in truss topology optimization | BibTeX data for Exploiting group symmetry in truss topology optimization

Exponential lower bound for static semi−algebraic proofs

Dima Grigoriev‚ Edward A. Hirsch and Dmitrii Pasechnik

In Automata‚ languages and programming. Vol. 2380 of Lecture Notes in Comput. Sci.. Pages 257–268. Springer, Berlin. 2002.

Details about Exponential lower bound for static semi−algebraic proofs | BibTeX data for Exponential lower bound for static semi−algebraic proofs

Extended generalized octagons and the group He

Dmitrii V. Pasechnik

In Geom. Dedicata. Vol. 56. No. 1. Pages 85–101. 1995.

Details about Extended generalized octagons and the group He | BibTeX data for Extended generalized octagons and the group He

Extended 4−buildings and the Baby Monster

A. A. Ivanov‚ D. V. Pasechnik and S. V. Shpectorov

In Invent. Math.. Vol. 144. No. 2. Pages 399–433. 2001.

Details about Extended 4−buildings and the Baby Monster | BibTeX data for Extended 4−buildings and the Baby Monster

Extending polar spaces of rank at least 3

Dmitrii V. Pasechnik

In J. Combin. Theory Ser. A. Vol. 72. No. 2. Pages 232–242. 1995.

Details about Extending polar spaces of rank at least 3 | BibTeX data for Extending polar spaces of rank at least 3

Geometric characterization of graphs from the Suzuki chain

Dmitrii V. Pasechnik

In European J. Combin.. Vol. 14. No. 5. Pages 491–499. 1993.

Algebraic combinatorics (Vladimir‚ 1991)

Details about Geometric characterization of graphs from the Suzuki chain | BibTeX data for Geometric characterization of graphs from the Suzuki chain

Geometric characterization of the sporadic groups Fi22‚ Fi23‚ and Fi24

Dmitrii V. Pasechnik

In J. Combin. Theory Ser. A. Vol. 68. No. 1. Pages 100–114. 1994.

Details about Geometric characterization of the sporadic groups Fi22‚ Fi23‚ and Fi24 | BibTeX data for Geometric characterization of the sporadic groups Fi22‚ Fi23‚ and Fi24

Implementing Brouwer's database of strongly regular graphs

N. Cohen and D. V. Pasechnik

In Designs‚ Codes‚ and Cryptography. Vol. to appear. 2016.

http://dx.doi.org/10.1007/s10623−016−0264−x

Details about Implementing Brouwer's database of strongly regular graphs | BibTeX data for Implementing Brouwer's database of strongly regular graphs

Improved bounds for the crossing numbers of K_m‚n and K_n

E. de Klerk‚ D. V. Pasechnik‚ J. Maharry‚ B. Richter and G. Salazar

In SIAM Journal on Discrete Mathematics. Vol. 20. Pages 189–202. 2006.

Details about Improved bounds for the crossing numbers of K_m‚n and K_n | BibTeX data for Improved bounds for the crossing numbers of K_m‚n and K_n

Improved lower bounds for book crossing numbers of complete graphs

E. de Klerk‚ D. V. Pasechnik and G. Salazar

In SIAM Journal on Discrete Mathematics. Vol. 27. Pages 619–633. 2013.

arXiv.org e−print math 1207.5701

Details about Improved lower bounds for book crossing numbers of complete graphs | BibTeX data for Improved lower bounds for book crossing numbers of complete graphs | DOI (10.1137/120886777)

Improved lower bounds for the 2−page crossing numbers of K_m‚n and K_n via semidefinite programming

E. de Klerk and D.V. Pasechnik

In SIAM Journal on Optimization. Vol. 22. Pages 581–595. 2012.

Details about Improved lower bounds for the 2−page crossing numbers of K_m‚n and K_n via semidefinite programming | BibTeX data for Improved lower bounds for the 2−page crossing numbers of K_m‚n and K_n via semidefinite programming | Link to Improved lower bounds for the 2−page crossing numbers of K_m‚n and K_n via semidefinite programming

Locally toroidal polytopes of rank 6 and sporadic groups

D. V. Pasechnik

In Advances in Mathematics. Vol. 312. Pages 459–472. 2017.

Details about Locally toroidal polytopes of rank 6 and sporadic groups | BibTeX data for Locally toroidal polytopes of rank 6 and sporadic groups | DOI (10.1016/j.aim.2017.03.029)

Majorana representations of the symmetric group of degree 4

Alexander A. Ivanov‚ Dmitrii V. Pasechnik‚ Akos Seress and Sergey Shpectorov

In Journal of Algebra. Vol. 324. Pages 2432−2463. 2010.

Details about Majorana representations of the symmetric group of degree 4 | BibTeX data for Majorana representations of the symmetric group of degree 4

Minimal representations of locally projective amalgams

A. A. Ivanov and D. V. Pasechnik

In J. London Math. Soc. (2). Vol. 70. No. 1. Pages 142–164. 2004.

Details about Minimal representations of locally projective amalgams | BibTeX data for Minimal representations of locally projective amalgams

Multiple extensions of generalized hexagons related to the simple groups McL and Co3

Hans Cuypers‚ Anna Kasikova and Dmitrii V. Pasechnik

In J. London Math. Soc. (2). Vol. 54. No. 1. Pages 16–24. 1996.

Details about Multiple extensions of generalized hexagons related to the simple groups McL and Co3 | BibTeX data for Multiple extensions of generalized hexagons related to the simple groups McL and Co3

New examples of finite C₂−geometries

Dmitrii V. Pasechnik

In Geom. Dedicata. Vol. 46. No. 2. Pages 161–164. 1993.

Details about New examples of finite C₂−geometries | BibTeX data for New examples of finite C₂−geometries

Non−abelian representations of some sporadic geometries

Alexander A. Ivanov‚ Dmitrii V. Pasechnik and Sergey V. Shpectorov

In J. Algebra. Vol. 181. No. 2. Pages 523–557. 1996.

Details about Non−abelian representations of some sporadic geometries | BibTeX data for Non−abelian representations of some sporadic geometries

Numerical block diagonalization of matrix *−algebras with application to semidefinite programming

E. de Klerk‚ C. Dobre and D. V. Pasechnik

In Mathematical Programming B. Vol. 129. No. 1. Pages 91−111. 2011.

e−print 2009−02−2244 at Optimization online

Details about Numerical block diagonalization of matrix *−algebras with application to semidefinite programming | BibTeX data for Numerical block diagonalization of matrix *−algebras with application to semidefinite programming | DOI (10.1007/s10107-011-0461-3)

On Semidefinite Programming Relaxations of Association Schemes With Application to Combinatorial Optimization Problems

E. de Klerk and D.V. Pasechnik

CentER Discussion Paper‚ 2009−54. 2009.

Details about On Semidefinite Programming Relaxations of Association Schemes With Application to Combinatorial Optimization Problems | BibTeX data for On Semidefinite Programming Relaxations of Association Schemes With Application to Combinatorial Optimization Problems | Link to On Semidefinite Programming Relaxations of Association Schemes With Application to Combinatorial Optimization Problems

On approximate graph colouring and MAX−k−CUT algorithms based on the ϑ−function

E. de Klerk‚ D. V. Pasechnik and J. P. Warners

In J. Comb. Optim.. Vol. 8. No. 3. Pages 267–294. 2004.

Details about On approximate graph colouring and MAX−k−CUT algorithms based on the ϑ−function | BibTeX data for On approximate graph colouring and MAX−k−CUT algorithms based on the ϑ−function

On computing Hilbert bases via the Elliot−MacMahon algorithm

Dmitrii V. Pasechnik

In Theoret. Comput. Sci.. Vol. 263. No. 1−2. Pages 37–46. 2001.

Combinatorics and computer science (Palaiseau‚ 1997)

Details about On computing Hilbert bases via the Elliot−MacMahon algorithm | BibTeX data for On computing Hilbert bases via the Elliot−MacMahon algorithm

On equicut graphs

Michel Deza and Dmitrii V. Pasechnik

In Mult.−Valued Log.. Vol. 7. No. 5−6. Pages 363–377. 2001.

Ivo G. Rosenberg's 65th birthday‚ Part 2

Details about On equicut graphs | BibTeX data for On equicut graphs

On moments of a polytope

N. Gravin‚ D.V. Pasechnik‚ B. Shapiro and M. Shapiro

arXiv.org e−print math 1210.3193‚ submitted to Adv. in Mathematics. 2012.

Details about On moments of a polytope | BibTeX data for On moments of a polytope

On polygonal measures with vanishing harmonic moments

D.V. Pasechnik and B. Shapiro

In Journal d'Analyse Mathématique. Vol. 123. No. 1. Pages 281–301. 2014.

arXiv.org e−print math 1209.4014

Details about On polygonal measures with vanishing harmonic moments | BibTeX data for On polygonal measures with vanishing harmonic moments | DOI (10.1007/s11854-014-0021-x)

On semidefinite programming relaxations of maximum k−section

E. de Klerk‚ C. Dobre‚ D.V. Pasechnik and R. Sotirov

In Mathematical Programming B. Vol. 136. No. 2. Pages 253−278. 2012.

e−print nr. 2010−07−2689 at Optimization online

Details about On semidefinite programming relaxations of maximum k−section | BibTeX data for On semidefinite programming relaxations of maximum k−section

On semidefinite programming relaxations of the traveling salesman problem

E. De Klerk‚ D.V. Pasechnik and R. Sotirov

In SIAM Journal on Optimization. Vol. 19. Pages 1559–1573. 2008.

Preprint 2007−12−1858 at Optimization online

Details about On semidefinite programming relaxations of the traveling salesman problem | BibTeX data for On semidefinite programming relaxations of the traveling salesman problem

On some locally 3−transposition graphs

D. V. Pasechnik

In Finite geometry and combinatorics (Deinze‚ 1992). Vol. 191 of London Math. Soc. Lecture Note Ser.. Pages 319–325. Cambridge Univ. Press, Cambridge. 1993.

Details about On some locally 3−transposition graphs | BibTeX data for On some locally 3−transposition graphs

On the complexity of Hilbert refutations for partition

S. Margulies‚ S. Onn and D. V. Pasechnik

In J. Symbolic Comput.. Vol. 66. Pages 70–83. 2015.

Details about On the complexity of Hilbert refutations for partition | BibTeX data for On the complexity of Hilbert refutations for partition | DOI (10.1016/j.jsc.2013.06.005)

On the irreducibility of a truncated binomial expansion

M. Filaseta‚ A. Kumchev and D. V. Pasechnik

In Rocky Mountains J. Math.. Vol. 37. Pages 455−464. 2007.

e−print math.NT/0409523 at arXiv.org

Details about On the irreducibility of a truncated binomial expansion | BibTeX data for On the irreducibility of a truncated binomial expansion

On the number of inductively minimal geometries

Philippe Cara‚ Serge Lehman and Dimitrii V. Pasechnik

In Theoret. Comput. Sci.. Vol. 263. No. 1−2. Pages 31–35. 2001.

Combinatorics and computer science (Palaiseau‚ 1997)

Details about On the number of inductively minimal geometries | BibTeX data for On the number of inductively minimal geometries

On the skeleton of the metric polytope

Antoine Deza‚ Komei Fukuda‚ Dmitrii Pasechnik and Masanori Sato

In Discrete and computational geometry (Tokyo‚ 2000). Vol. 2098 of Lecture Notes in Comput. Sci.. Pages 125–136. Springer, Berlin. 2001.

Details about On the skeleton of the metric polytope | BibTeX data for On the skeleton of the metric polytope

On transitive permutation groups with primitive subconstituents

Dmitrii V. Pasechnik and Cheryl E. Praeger

In Bull. London Math. Soc.. Vol. 31. No. 3. Pages 257–268. 1999.

Details about On transitive permutation groups with primitive subconstituents | BibTeX data for On transitive permutation groups with primitive subconstituents

On NP−hardness of the clique partition – Independence number gap recognition and related problems

S. Busygin and D. V. Pasechnik

In Discrete Mathematics. Vol. 306. Pages 460−463. 2006.

Details about On NP−hardness of the clique partition – Independence number gap recognition and related problems | BibTeX data for On NP−hardness of the clique partition – Independence number gap recognition and related problems

Polynomial−time computing over quadratic maps I. Sampling in real algebraic sets

D. Grigoriev and D. V. Pasechnik

In Computational Complexity. Vol. 14. Pages 20–52. 2005.

e−print cs.SC/0403008 at arXiv.org

Details about Polynomial−time computing over quadratic maps I. Sampling in real algebraic sets | BibTeX data for Polynomial−time computing over quadratic maps I. Sampling in real algebraic sets

Products of positive forms‚ linear matrix inequalities‚ and Hilbert 17th problem for ternary forms

Etienne de Klerk and Dmitrii V. Pasechnik

In European J. Oper. Res.. Vol. 157. No. 1. Pages 39–45. 2004.

Details about Products of positive forms‚ linear matrix inequalities‚ and Hilbert 17th problem for ternary forms | BibTeX data for Products of positive forms‚ linear matrix inequalities‚ and Hilbert 17th problem for ternary forms

Reduction of symmetric semidefinite programs using the regular *−representation

Etienne de Klerk‚ Dmitrii V. Pasechnik and Alexander Schrijver

In Mathematical Programming B. Vol. 109. Pages 613–624. 2007.

e−print 2005−03−1083‚ Optimization Online

Details about Reduction of symmetric semidefinite programs using the regular *−representation | BibTeX data for Reduction of symmetric semidefinite programs using the regular *−representation

Relaxations of combinatorial problems via association schemes

E.de Klerk‚ F.M. de Oliveira Filho and D. V. Pasechnik

In M.F.Anjos and J.B.Lasserre, editors, Handbook on Semidefinite‚ Cone and Polynomial Optimization. Vol. 166 of International Series in Operations Research and Management Science. Pages 171−199. Elsevier. 2012.

e−print nr. 2010−07−2690 at Optimization online

Details about Relaxations of combinatorial problems via association schemes | BibTeX data for Relaxations of combinatorial problems via association schemes

RepnDecomp: A GAP package for decomposing linear representations of finite groups

Kaashif Hymabaccus and Dmitrii Pasechnik

In Journal of Open Source Software. Vol. 5.50. Pages 1835−1836. 2020.

Details about RepnDecomp: A GAP package for decomposing linear representations of finite groups | BibTeX data for RepnDecomp: A GAP package for decomposing linear representations of finite groups | DOI (10.21105/joss.01835)

Sandpile groups of generalized de Bruijn and Kautz graphs and circulant matrices over finite fields

Chan Swee Hong‚ H. Hollmann and D.V. Pasechnik

In Journal of Algebra. Vol. 421. Pages 268–295. 2015.

arXiv.org e−print math 1405.0113

Details about Sandpile groups of generalized de Bruijn and Kautz graphs and circulant matrices over finite fields | BibTeX data for Sandpile groups of generalized de Bruijn and Kautz graphs and circulant matrices over finite fields | DOI (10.1016/j.jalgebra.2014.08.029)

Skew−symmetric association schemes with two classes and strongly regular graphs of type 2n−1(4n−1)

Dmitrii V. Pasechnik

In Acta Appl. Math.. Vol. 29. No. 1−2. Pages 129–138. 1992.

Interactions between algebra and combinatorics

Details about Skew−symmetric association schemes with two classes and strongly regular graphs of type 2n−1(4n−1) | BibTeX data for Skew−symmetric association schemes with two classes and strongly regular graphs of type 2n−1(4n−1)

Splitting fields of real irreducible representations of finite groups

Dmitrii Pasechnik

In Representation Theory. Vol. 25. Pages 897−902. 2021.

Details about Splitting fields of real irreducible representations of finite groups | BibTeX data for Splitting fields of real irreducible representations of finite groups | DOI (10.1090/ert/587)

Strategic Considerations in the Design of Committees

E. Elkind‚ D.V. Pasechnik and M. Wooldridge

In Proceedings of AAMAS 2013. Pages 439–446. IFAAMAS. 2013.

Details about Strategic Considerations in the Design of Committees | BibTeX data for Strategic Considerations in the Design of Committees | Download (pdf) of Strategic Considerations in the Design of Committees

Subsets close to invariant subsets for group actions

Leonid Brailovsky‚ Dmitrii V. Pasechnik and Cheryl E. Praeger

In Proc. Amer. Math. Soc.. Vol. 123. No. 8. Pages 2283–2295. 1995.

Details about Subsets close to invariant subsets for group actions | BibTeX data for Subsets close to invariant subsets for group actions

The Cost of Stability and Its Application to Weighted Voting Games

Yoram Bachrach‚ Edith Elkind‚ Reshef Meir‚ Dmitrii Pasechnik‚ Michael Zuckerman‚ Joerg Rothe and Jeffrey Rosenschein

In Maria Mavronicolas Marios; Papadoupoulou, editor, Algorithmic Game Theory‚ 2nd International Symposium‚ SAGT 2009. Vol. 5814 of Lecture Notes in Comput. Sci.. Pages 122−134. Springer, Berlin. 2009.

Details about The Cost of Stability and Its Application to Weighted Voting Games | BibTeX data for The Cost of Stability and Its Application to Weighted Voting Games | DOI (10.1007/978-3-642-04645-2)

The automorphism group and the convex subgraphs of the quadratic forms graph in characteristic 2

A. Munemasa‚ D. V. Pasechnik and S. V. Shpectorov

In Journal of Algebraic Combinatorics. Vol. 2. No. 4. Pages 411–419. 1993.

Details about The automorphism group and the convex subgraphs of the quadratic forms graph in characteristic 2 | BibTeX data for The automorphism group and the convex subgraphs of the quadratic forms graph in characteristic 2

The extensions of the generalized quadrangle of order (3‚9)

Dmitrii V. Pasechnik

In European J. Combin.. Vol. 17. No. 8. Pages 751–755. 1996.

Details about The extensions of the generalized quadrangle of order (3‚9) | BibTeX data for The extensions of the generalized quadrangle of order (3‚9)

The inverse moment problem for convex polytopes

N. Gravin‚ J.B. Lasserre‚ D.V. Pasechnik and S. Robins

In Discrete and Computational Geometry. Vol. 48. No. 3. Pages 596–621. 2011.

Details about The inverse moment problem for convex polytopes | BibTeX data for The inverse moment problem for convex polytopes | Link to The inverse moment problem for convex polytopes

The isometries of the cut‚ metric and hypermetric cones

A. Deza‚ B. Goldengorin and D. V. Pasechnik

In Journal of Algebraic Combinatorics. Vol. 23. Pages 197–203. 2006.

e−print math.MG/0306049 at arXiv.org

Details about The isometries of the cut‚ metric and hypermetric cones | BibTeX data for The isometries of the cut‚ metric and hypermetric cones

The triangular extensions of a generalized quadrangle of order (3‚3)

Dmitrii V. Pasechnik

In Bull. Belg. Math. Soc. Simon Stevin. Vol. 2. No. 5. Pages 509–518. 1995.

Details about The triangular extensions of a generalized quadrangle of order (3‚3) | BibTeX data for The triangular extensions of a generalized quadrangle of order (3‚3)

The universal covers of certain semibiplanes

Barbara Baumeister and Dmitrii V. Pasechnik

In European J. Combin.. Vol. 18. No. 5. Pages 491–496. 1997.

Details about The universal covers of certain semibiplanes | BibTeX data for The universal covers of certain semibiplanes

The universal covers of the sporadic semibiplanes

Barbara Baumeister and Dmitrii V. Pasechnik

In European J. Combin.. Vol. 17. No. 7. Pages 595–604. 1996.

Details about The universal covers of the sporadic semibiplanes | BibTeX data for The universal covers of the sporadic semibiplanes

Two distance−regular graphs

Andries E. Brouwer and Dmitrii V. Pasechnik

In Journal of Algebraic Combinatorics. Vol. 36. No. 3. Pages 403–407. 2012.

Details about Two distance−regular graphs | BibTeX data for Two distance−regular graphs | DOI (10.1007/s10801-011-0341-1)

c−extensions of the 4(2)−building

A. A. Ivanov and D. V. Pasechnik

In Discrete Math.. Vol. 264. No. 1−3. Pages 91–110. 2003.

The 2000 2MaC Conference on Association Schemes‚ Codes and Designs (Pohang)

Details about c−extensions of the 4(2)−building | BibTeX data for c−extensions of the 4(2)−building

An efficient sum of squares nonnegativity certificate for quaternary quartic

D. V. Pasechnik

November, 2015.

Details about An efficient sum of squares nonnegativity certificate for quaternary quartic | BibTeX data for An efficient sum of squares nonnegativity certificate for quaternary quartic

CSS−like Constructions of Asymmetric Quantum Codes

M.F. Ezerman‚ Somphong Jitman‚ San Ling and D.V. Pasechnik

In IEEE Transactions on Information Theory. Vol. 59. No. 10. Pages 6732–6754. 2013.

arXiv.org e−print cs 1207.6512

Details about CSS−like Constructions of Asymmetric Quantum Codes | BibTeX data for CSS−like Constructions of Asymmetric Quantum Codes

Edge−dominating cycles‚ k−walks and Hamilton prisms in 2K₂−free graphs

G. Mou and D. Pasechnik

In J. Knot Theory and its Ramifications. Vol. 25. Pages 1–9. 2016.

Details about Edge−dominating cycles‚ k−walks and Hamilton prisms in 2K₂−free graphs | BibTeX data for Edge−dominating cycles‚ k−walks and Hamilton prisms in 2K₂−free graphs | DOI (10.1142/S0218216516420116)

Random Chain Complexes

V. L. Ginzburg and D. V. Pasechnik

In Arnold Mathematical Journal. Vol. to appear. February, 2016.

Details about Random Chain Complexes | BibTeX data for Random Chain Complexes

The inverse moment problem for convex polytopes: implementation aspects

N. Gravin‚ D. Nguyen‚ D. Pasechnik and S. Robins

arXiv.org e−print math 1409.3130. September, 2014.

Details about The inverse moment problem for convex polytopes: implementation aspects | BibTeX data for The inverse moment problem for convex polytopes: implementation aspects

Cohcfg‚ a GAP package for coherent configurations (preliminary version)

D.V. Pasechnik and K. Kini

software download. 2010.

Details about Cohcfg‚ a GAP package for coherent configurations (preliminary version) | BibTeX data for Cohcfg‚ a GAP package for coherent configurations (preliminary version) | Link to Cohcfg‚ a GAP package for coherent configurations (preliminary version)