Empilements de sphères
Entropy, capacity and arrangements on the cube.
Enumeration of 2-isohedral tilings on the sphere
Equidissections of centrally symmetric octagons.
Equilateral, diametral, centered sets and subsets of spheres.
Equivalence classes of Latin squares and nets in
The fundamental combinatorial structure of a net in is its associated set of mutually orthogonal Latin squares. We define equivalence classes of sets of orthogonal Latin squares by label equivalences of the lines of the corresponding net in . Then we count these equivalence classes for small cases. Finally we prove that the realization spaces of these classes in are empty to show some non-existence results for 4-nets in .
Erratum to: Covering the unit cube by equal balls.
Erratum to “Eigenvalues of GUE minors" [Electron. J. Probab. 11, 1342–1371 (2006; Zbl 1127.60047)].
Euclidean Number Fields of Large Degree
Euclidean perimeter of classes of optimal convex lattice -gons.
Even astral configurations.
Expectation and variance of the volume covered by a large number of independent random sets
Explicit Ramsey graphs and Erdős distance problems over finite Euclidean and non-Euclidean spaces.
Exponentials Form a Basis of Discrete Holomorphic Functions on a Compact
We show that discrete exponentials form a basis of discrete holomorphic functions on a finite critical map. On a combinatorially convex set, the discrete polynomials form a basis as well.
Extremal Convex Sets.
Extremal Packing and Covering Sets.
Factoring a finite Abelian group by prime complexes.
Factoring Abelian groups of order .
Factoring an odd abelian group by lacunary cyclic subsets
It is a known result that if a finite abelian group of odd order is a direct product of lacunary cyclic subsets, then at least one of the factors must be a subgroup. The paper gives an elementary proof that does not rely on characters.
Factoring by nonsubgroup factors.