English
Related papers

Related papers: Atom-generated planar lattices

200 papers

If the number of runs in a (mixed-level) orthogonal array of strength 2 is specified, what numbers of levels and factors are possible? The collection of possible sets of parameters for orthogonal arrays with N runs has a natural lattice…

Combinatorics · Mathematics 2014-11-18 E. M. Rains , N. J. A. Sloane , John Stufken

We present in this paper a routine which construct the ideal generated by a list of elements in a matrix Lie algebra at any particular characteristic. We have used this algorithm to analyze the problem of the simplicity of some Lie…

Numerical Analysis · Mathematics 2025-10-20 Pablo Alberca Bjerregaard , Candido Martin Gonzalez

We prove that all definable pre-orders are atomic, in a finitely generated free algebra of a discriminator variety of finite similarity type which is generated by its finite members.

Logic · Mathematics 2016-06-27 H. Andréka , I. Németi

Special orthogonal matrices with rational elements form the group SO(n,Q), where Q is the field of rational numbers. A theorem describing the structure of an arbitrary matrix from this group is proved. This theorem yields an algorithm for…

Mathematical Software · Computer Science 2009-10-14 Ruslan Sharipov

The 4-simplex has vertices 5 unit quaternions, which we arrange so that one of them is the unit. We show that the remaining 4 vertices are the generators of a free group. For the proof, we introduce a new alternating length on words in free…

Representation Theory · Mathematics 2015-06-02 Adrian Ocneanu

We characterize well-founded algebraic lattices by means of forbidden subsemilattices of the join-semilattice made of their compact elements. More specifically, we show that an algebraic lattice $L$ is well-founded if and only if $K(L)$,…

Combinatorics · Mathematics 2008-12-15 Ilham Chakir , Maurice Pouzet

It has been shown recently that monomial maps in a large class respecting the action of the infinite symmetric group have, up to symmetry, finitely generated kernels. We study the simplest nontrivial family in this class: the maps given by…

Commutative Algebra · Mathematics 2015-09-11 Thomas Kahle , Robert Krone , Anton Leykin

For an arbitrary partially ordered set $P$ its {\em dual} $P^*$ is built as the collection of all monotone mappings $P\to\2$ where $\2=\{0,1\}$ with $0<1$. The set of mappings $P^*$ is proved to be a complete lattice with respect to the…

Category Theory · Mathematics 2007-05-23 Roman R. Zapatrin

We split the crossings of the foil knot and enumerate the resulting states with a generating polynomial. Unexpectedly, the number of such states which consist of two components are given by the lazy caterer's sequence. This sequence…

Combinatorics · Mathematics 2017-12-13 Franck Ramaharo , Fanja Rakotondrajao

Left-modularity is a concept that generalizes modularity in lattice theory. In this paper, we give a characterization of left-modular elements and derive two formulae for the characteristic polynomial of a lattice with such an element, one…

Combinatorics · Mathematics 2007-05-23 Shu-Chung Liu , Bruce Sagan

We prove a sharp bound for the remainder term of the number of lattice points inside a ball, when averaging over a compact set of (not necessarily unimodular) lattices, in dimensions two and three. We also prove that such a bound cannot…

Number Theory · Mathematics 2013-11-13 Samuel Holmin

The generation of harmonics by atoms interacting with two circularly polarized and frequency related laser fields is addressed through ab initio numerical simulations. A detailed charaterization of a few specific harmonics is given. In…

Atomic Physics · Physics 2009-11-10 F. Ceccherini , N. Davini , D. Bauer , F. Cornolti

Let $G$ be a 3-partite graph with $k$ vertices in each part and suppose that between any two parts, there is no cycle of length four. Fischer and Matou\u{s}ek asked for the maximum number of triangles in such a graph. A simple construction…

Combinatorics · Mathematics 2017-02-07 Robert S. Coulter , Rex W. Matthews , Craig Timmons

We extend the results of Ozeki on the configurations of extremal even unimodular lattices. Specifically, we show that if L is such a lattice of rank 56, 72, or 96, then L is generated by its minimal-norm vectors.

Number Theory · Mathematics 2011-11-11 Scott D. Kominers

We define an easily verifiable notion of an atomic formula having uniformly bounded arrays in a structure $M$. We prove that if $T$ is a complete $L$-theory, then $T$ is mutually algebraic if and only if there is some model $M$ of $T$ for…

Logic · Mathematics 2020-11-11 Michael C. Laskowski , Caroline A. Terry

For a finite lattice $L$, let Gm($L$) denote the least $n$ such that $L$ can be generated by $n$ elements. For integers $r>2$ and $k>1$, denote by FD$(r)^k$ the $k$-th direct power of the free distributive lattice FD($r$) on $r$ generators.…

Combinatorics · Mathematics 2023-11-09 Gábor Czédli

Vortices are topologically stable singularities at the center of a swirl of energy. Optical vortices are conventionally formed using diffractive optics or by bespoke optical elements. We report room temperature integrated lasers directly…

Optics · Physics 2019-04-29 B. Bahari , L. -Y. Hsu , S. H. Pan , D. Preece , A. Ndao , A. El Amili , Y. Fainman , B. Kanté

A lattice L is slim if it is finite and the set of its join-irreducible elements contains no three-element antichain. Slim, semimodular lattices were previously characterized by G. Cz\'edli and E.T. Schmidt as the duals of the lattices…

Rings and Algebras · Mathematics 2012-08-31 Gábor Czédli , Tamás Dékány , László Ozsvárt , Nóra Szakács , Balázs Udvari

A rack is a set together with a self-distributive bijective binary operation. In this paper, we give a positive answer to a question due to Heckenberger, Shareshian and Welker. Indeed, we prove that the lattice of subracks of a rack is…

Combinatorics · Mathematics 2018-02-23 Amir Saki , Dariush Kiani

We propose a construction of lattices from (skew-) polynomial codes, by endowing quotients of some ideals in both number fields and cyclic algebras with a suitable trace form. We give criteria for unimodularity. This yields integral and…

Information Theory · Computer Science 2020-04-06 Grégory Berhuy , Frédérique Oggier