中文
相关论文

相关论文: Construction of some perfect integral lattices wit…

200 篇论文

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…

数论 · 数学 2013-06-20 Elisabeth Nossek

Given a rational lattice and suitable set of linear transformations, we construct a cousin lattice. Sufficient conditions are given for integrality, evenness and unimodularity. When the input is a Barnes-Wall lattice, we get multi-parameter…

数论 · 数学 2009-10-12 Robert L. Griess

We present an improved orderly algorithm for constructing all unlabelled lattices up to a given size, that is, an algorithm that constructs the minimal element of each isomorphism class relative to some total order. Our algorithm employs a…

组合数学 · 数学 2019-12-23 Volker Gebhardt , Stephen Tawn

It is possible for a combinatorial type of polytope to have both decomposable and indecomposable realizations; here decomposability is meant with respect to Minkowski addition. Such polytopes are called conditionally decomposable. We show…

组合数学 · 数学 2024-06-04 Jie Wang , David Yost

A sublattice of the three-dimensional integer lattice $\mathbb Z^3$ is called cubic sublattice if there exists a basis of the sublattice whose elements are pairwise orthogonal and of equal lengths. We show that for an integer vector…

度量几何 · 数学 2022-03-04 Márton Horváth

Let $\Lambda$ be a lattice in $\R^n$, and let $Z\subseteq \R^{m+n}$ be a definable family in an o-minimal structure over $\R$. We give sharp estimates for the number of lattice points in the fibers $Z_T={x\in \R^n: (T,x)\in Z}$. Along the…

数论 · 数学 2013-04-30 Fabrizio Barroero , Martin Widmer

We prove that the very simple lattices which consist of a largest, a smallest and $2n$ pairwise incomparable elements where $n$ is a positive integer can be realized as the lattices of intermediate subfactors of finite index and finite…

算子代数 · 数学 2009-05-09 Feng Xu

There exist numerous results in the literature proving that within certain families of totally real number fields, the minimal rank of a universal quadratic lattice over such a field can be arbitrarily large. Kala introduced a technique of…

数论 · 数学 2025-08-01 Matěj Doležálek

We provide an introduction to recent lattice formulations of supersymmetric theories which are invariant under one or more real supersymmetries at nonzero lattice spacing. These include the especially interesting case of ${\cal N}=4$ SYM in…

高能物理 - 格点 · 物理学 2015-05-13 Simon Catterall , David B. Kaplan , Mithat Unsal

We consider the set of all linear combinations with integer coefficients of the vectors of a unit tight equiangular $(k,n)$ frame and are interested in the question whether this set is a lattice, that is, a discrete additive subgroup of the…

For a finite group $G$, let $d(G)$ denote the minimal number of elements required to generate $G$. In this paper, given a finite almost simple group $G$ and any maximal subgroup $H$ of $G$, we determine a precise upper bound for $d(H)$. In…

群论 · 数学 2020-07-01 Andrea Lucchini , Claude Marion , Gareth Tracey

We construct Euclidean lattices whose sets of minimal vectors support some large equiangular families of lines, using notably reduction modulo~$2$ of lattices. %as considered in \cite{Ma1} and \cite{Ma2}. We also consider some related…

数论 · 数学 2024-03-15 Jacques Martinet

Similar sublattices of the root lattice $A_4$ are possible, according to a result of Conway, Rains and Sloane, for each index that is the square of a non-zero integer of the form $m^2 + mn - n^2$. Here, we add a constructive approach, based…

度量几何 · 数学 2019-07-17 Michael Baake , Manuela Heuer , Robert V. Moody

Additive spanners are fundamental graph structures with wide applications in network design, graph sparsification, and distance approximation. In particular, a $4$-additive spanner is a subgraph that preserves all pairwise distances up to…

数据结构与算法 · 计算机科学 2025-10-21 Chuhan Qi

We show that all balanced d-lattices must be complemented, answering a question of Chajda and Eigenthaler. (A bounded lattice is balanced if any two congruences agree on their 1-classes iff they agree on their 0-classes.) Our main tool is…

环与代数 · 数学 2007-05-23 Martin Goldstern , Miroslav Ploscica

We are interested in algebraic properties of empty lattice simplices $\Delta$, that is, $d$-dimensional lattice polytopes containing exactly $d+1$ points of the integer lattice $\mathbb{Z}^d$. The cyclicity rank of $\Delta$ is the minimal…

组合数学 · 数学 2025-03-10 Lukas Abend , Matthias Schymura

Let $\Lb$ be a lattice in an $n$-dimensional Euclidean space $E$ and let $\Lb'$ be a Minkowskian sublattice of $\Lb$, that is, a sublattice having a basis made of representatives for the Minkowski successive minima of $\Lb$. We consider the…

数论 · 数学 2012-02-13 Jacques Martinet

In 2008, L\'aszl\'o Z\'adori proved that the lattice Sub$(V)$ of all subspaces of a vector space $V$ of finite dimension at least 3 over a finite field $F$ has a 5-element generating set; in other words, Sub$(V)$ is 5-generated. We prove…

环与代数 · 数学 2024-01-18 Gábor Czédli

A lattice is called well-rounded if its minimal vectors span the corresponding Euclidean space. In this paper we study the similarity classes of well-rounded sublattices of ${\mathbb Z}^2$. We relate the set of all such similarity classes…

数论 · 数学 2009-08-25 Lenny Fukshansky

This paper examines the problem of obtaining a $D(4)$-quadruple by adding a smaller element to a $D(4)$-triple. We prove some relations between elements of observed hypothetical $D(4)$-quadruples under which conjecture of the uniqueness of…

数论 · 数学 2026-03-12 Marija Bliznac Trebješanin , Pavao Radić