The Order of Points on the Second Convex Hull of a Simple Polygon.
The prime power conjecture is true for .
The problem of kings.
The problem of the kings.
The shape of a typical boxed plane partition.
The simple 7-(33, 8, 10)-designs with automorphism group P-Gamma-L(2, 23).
The size of minimum 3-trees: cases 0 and 1 mod 12
A 3-uniform hypergraph is called a minimum 3-tree, if for any 3-coloring of its vertex set there is a heterochromatic triple and the hypergraph has the minimum possible number of triples. There is a conjecture that the number of triples in such 3-tree is ⎡(n(n-2))/3⎤ for any number of vertices n. Here we give a proof of this conjecture for any n ≡ 0,1 mod 12.
The spectra of certain classes of room frames: the last cases.
The spectrum of idempotent varieties of algebras with binary operators based on two variable identities. (Short Communication).
The spectrum of idempotent varieties of algebras with binary operators based on two variable identities.
The strongly perfect lattices of dimension
This paper classifies the strongly perfect lattices in dimension . There are up to similarity two such lattices, and its dual lattice.
The summation package Sigma: underlying principles and a rhombus tiling application.
The three dimensional polyominoes of minimal area.
The toric ideal of a matroid of rank 3 is generated by quadrics.
The tree of life and other affine buildings.
The Tutte group of projective spaces.
The Tutte polynomial of a morphism of matroids I. Set-pointed matroids and matroid perspectives
We study the basic algebraic properties of a 3-variable Tutte polynomial the author has associated with a morphism of matroids, more precisely with a matroid strong map, or matroid perspective in the present paper, or, equivalently by the Factorization Theorem, with a matroid together with a distinguished subset of elements. Most algebraic properties of the usual 2-variable Tutte polynomial of a matroid generalize to the 3-variable polynomial. Among specific properties we show that the 3-variable...
The umbral transfer-matrix method. III: Counting animals.
The umbral transfer-matrix method. IV: Counting self-avoiding polygons and walks.
The universal embedding of the near polygon .