English
Related papers

Related papers: On lattices of maximal index two

200 papers

For a modular lattice $L$ of finite length, we prove that the distributivity of $L$ is a sufficient condition while its 2-distributivity is a necessary condition that those sublattices of $L$ that are closed under taking relative…

Rings and Algebras · Mathematics 2022-01-19 Gábor Czédli

We construct lattice action for five-dimensional maximally supersymmetric Yang-Mills theory. This supersymmetric lattice formulation can be used to explore the non-perturbative regime of the continuum target theory, which has a known…

High Energy Physics - Lattice · Physics 2016-06-14 Anosh Joseph

In this article we prove that integral lattices with minimum <= 7 (or <= 9) whose set of minimal vectors form spherical 9-designs (or 11-designs respectively) are extremal, even and unimodular. We furthermore show that there does not exist…

Number Theory · Mathematics 2013-06-20 Elisabeth Nossek

We prove that every connected cubic graph with $n$ vertices has a maximal matching of size at most $\frac{5}{12} n+ \frac{1}{2}$. This confirms the cubic case of a conjecture of Baste, F\"urst, Henning, Mohr and Rautenbach (2019) on regular…

Combinatorics · Mathematics 2021-08-10 Wouter Cames van Batenburg

The paper investigates uniformly closed subspaces, sublattices, and ideals of finite codimension in Archimedean vector lattices. It is shown that every uniformly closed subspace (or sublattice) of finite codimension may be written as an…

Functional Analysis · Mathematics 2024-03-13 Eugene Bilokopytov , Vladimir G. Troitsky

By a twenty year old result of Ralph Freese, an $n$-element lattice $L$ has at most $2^{n-1}$ congruences. We prove that if $L$ has less than $2^{n-1}$ congruences, then it has at most $2^{n-2}$ congruences. Also, we describe the…

Rings and Algebras · Mathematics 2017-12-19 Gábor Czédli

This work investigates linear precoding over non-singular linear channels with additive white Gaussian noise, with lattice-type inputs. The aim is to maximize the minimum distance of the received lattice points, where the precoder is…

Information Theory · Computer Science 2012-04-10 D. Kapetanovic , H. V. Cheng , W. H. Mow , F. Rusek

The mean-centered cuboidal (or m.c.c.) lattice is known to be the optimal packing and covering among all isodual three-dimensional lattices. In this note we show that it is also the best quantizer. It thus joins the isodual lattices Z, A_2…

Number Theory · Mathematics 2014-09-17 J. H. Conway , N. J. A. Sloane

An even lattice $M$ of signature $(n,2)$ is called $2$-reflective if there is a non-constant modular form for the orthogonal group of $M$ which vanishes only on quadratic divisors orthogonal to $2$-roots of $M$. In [Amer. J. Math. 2017]…

Number Theory · Mathematics 2023-01-30 Haowu Wang

A good edge-labelling of a simple, finite graph is a labelling of its edges with real numbers such that, for every ordered pair of vertices (u,v), there is at most one nondecreasing path from u to v. In this paper we prove that any graph on…

Combinatorics · Mathematics 2014-03-18 Abbas Mehrabian , Dieter Mitsche , Paweł Prałat

This paper studies a problem of Erd\"{o}s concerning lattice cubes. Given an $N \times N \times N$ lattice cube, we want to find the maximum number of vertices one can select so that no eight corners of a rectangular box are chosen…

Combinatorics · Mathematics 2020-12-01 Chengcheng Yang

A Lattice is a partially ordered set where both least upper bound and greatest lower bound of any pair of elements are unique and exist within the set. K\"{o}tter and Kschischang proved that codes in the linear lattice can be used for error…

Discrete Mathematics · Computer Science 2021-09-30 Pranab Basu

We study an upper bound of ranks of $n$-tensors with size $2\times\cdots\times2$ over the complex and real number field. We characterize a $2\times 2\times 2$ tensor with rank 3 by using the Cayley's hyperdeterminant and some function. Then…

Rings and Algebras · Mathematics 2013-06-05 Toshio Sumi , Toshio Sakata , Mitsuhiro Miyazaki

Let $L$ be any integral lattice in the 2-dimensional Euclidean space. Generalizing the earlier works of Hiroshi Maehara and others, we prove that for every integer $n>0$, there is a circle in the plane $\mathbb{R}^{2}$ that passes through…

Combinatorics · Mathematics 2012-06-29 Eiichi Bannai , Tsuyoshi Miezaki

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

The index of a signed graph is the largest eigenvalue of its adjacency matrix. For positive integers $n$ and $m\le n^2/4$, we determine the maximal index of complete signed graphs with $n$ vertices and $m$ negative edges. This settles (the…

Combinatorics · Mathematics 2021-05-04 Ebrahim Ghorbani , Arezoo Majidi

We provide details of the lattice construction of five-dimensional maximally supersymmetric Yang-Mills theory. The lattice theory is supersymmetric, gauge invariant and free from spectrum doublers. Such a supersymmetric lattice formulation…

High Energy Physics - Lattice · Physics 2016-10-12 Anosh Joseph

We study the maximal number of pairwise distinct columns in a $\Delta$-modular integer matrix with $m$ rows. Recent results by Lee et al. provide an asymptotically tight upper bound of $O(m^2)$ for fixed $\Delta$. We complement this and…

Combinatorics · Mathematics 2022-07-12 Gennadiy Averkov , Matthias Schymura

In this paper, we consider integral maximal lattice-free simplices. Such simplices have integer vertices and contain integer points in the relative interior of each of their facets, but no integer point is allowed in the full interior. In…

Optimization and Control · Mathematics 2009-05-19 Kent Andersen , Christian Wagner , Robert Weismantel

Inspired by the work of Backelin on non-commutative correspondences to Macaulay's theorem of the growth of the Hilbert series of affine algebras, we study embedding dimension dependant versions of his degree 2 to degree 3 result. In…

Combinatorics · Mathematics 2008-05-29 Jan Snellman