Factoring a finite Abelian group by prime complexes.
Page 1 Next
Displaying 1 – 20 of 22
Factoring Abelian groups of order .
Szabó, Sándor, Amin, Khalid (1996)
Mathematica Pannonica
Factoring an odd abelian group by lacunary cyclic subsets
Sándor Szabó (2010)
Discussiones Mathematicae - General Algebra and Applications
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.
Corrádi, Keresztély, Szabó, Sándor (1994)
Beiträge zur Algebra und Geometrie
Factorization results with combinatorial proofs.
Corrádi, Keresztély, Szabó, Sándor (2009)
Integers
Filling a box with translates of two bricks.
Kolountzakis, Mihail N. (2004)
The Electronic Journal of Combinatorics [electronic only]
Finite and infinite packings.
Jörg M. Wills, Ulrich Betke, Martin Henk (1994)
Journal für die reine und angewandte Mathematik
Finite and Uniform Stability of Sphere Coverings.
K. Bezdek, A. Bezdek, R. Connelly (1995)
Discrete & computational geometry
Finite Coverings by Translates of Centrally Symmetric Convex Domains.
Fejes G. Tóth (1987)
Discrete & computational geometry
Finite Sphere Packing and Sphere Covering.
J.M. Wills, Fejes G. Tóth, P. Gritzmann (1989)
Discrete & computational geometry
Finite sphere packings and critical radii.
Böröczky, K.jun., Wills, J.M. (1997)
Beiträge zur Algebra und Geometrie
Flexible cross-polytopes in the Euclidean 4-space.
Stachel, Hellmuth (2000)
Journal for Geometry and Graphics
Flight in a Packing of Disks.
Fejes L. Tóth (1993)
Discrete & computational geometry
Formality of the complements of subspace arrangements with geometric lattices.
Feichtner, E.M., Yuzvinsky, S. (2005)
Zapiski Nauchnykh Seminarov POMI
Formes quadratiques encapsulées
François Sigrist (1990)
Journal de théorie des nombres de Bordeaux
Four series of hyperbolic space groups with simplicial domains, and their supergroups
Milica Stojanović (2011)
Kragujevac Journal of Mathematics
Fourier analysis, linear programming, and densities of distance avoiding sets in
Fernando Mário de Oliveira Filho, Frank Vallentin (2010)
Journal of the European Mathematical Society
We derive new upper bounds for the densities of measurable sets in which avoid a finite set of prescribed distances. The new bounds come from the solution of a linear programming problem. We apply this method to obtain new upper bounds for measurable sets which avoid the unit distance in dimensions . This gives new lower bounds for the measurable chromatic number in dimensions . We apply it to get a short proof of a variant of a recent result of Bukh which in turn generalizes theorems of Furstenberg,...
Fractal Penrose tiles II: Tiles with fractal boundary as duals of Penrose triangles.
Götz Gelbrich (1997)
Aequationes mathematicae
Fractal Penrose tilings I. Construction and matching rules.
C. Bandt, P. Gummelt (1997)
Aequationes mathematicae
Free Arrangements and Relation Spaces.
K.A. Brandt, H. Terao (1994)
Discrete & computational geometry
Currently displaying 1 – 20 of 22
Page 1 Next