English
Related papers

Related papers: Cubic sublattices

200 papers

The set of permutations on a finite set can be given the lattice structure known as the weak Bruhat order. This lattice structure is generalized to the set of words on a fixed alphabet $\Sigma$ = {x,y,z,...}, where each letter has a fixed…

Combinatorics · Mathematics 2018-12-19 Maria João Gouveia , Luigi Santocanale

A lattice in the Euclidean space is standard if it has a basis consisting vectors whose norms equal to the length in its successive minima. In this paper, it is shown that with the $L^2$ norm all lattices of dimension $n$ are standard if…

Number Theory · Mathematics 2017-06-06 Rongquan Feng , Longke Tang , Kun Wang

We demonstrate equidistribution of the lattice shape of cubic fields when ordered by discriminant, giving an estimate in the Eisenstein series spectrum with a lower order main term. The analysis gives a separate discussion of the…

Number Theory · Mathematics 2024-09-16 Robert Hough , Eun Hye Lee

A perfect cuboid is a rectangular parallelepiped whose edges, whose face diagonals, and whose space diagonal are of integer lengths. The problem of finding such cuboids or proving their non-existence is not solved thus far. The second…

Number Theory · Mathematics 2015-04-28 A. A. Masharov , R. A. Sharipov

Keller's conjecture on cube tilings asserted that, in any tiling of $\mathbb{R}^d$ by unit cubes, there must exist two cubes that share a $(d-1)$-dimensional face. This is now known to be true in dimensions $d\leq 7$ and false for $d\geq…

Combinatorics · Mathematics 2024-04-22 Benjamin Bruce , Izabella Laba

Convex semilattices are algebras that are at the same time a convex algebra and a semilattice, together with a distributivity axiom. These algebras have attracted some attention in the last years as suitable algebras for probability and…

Logic in Computer Science · Computer Science 2025-07-16 Ana Sokolova , Harald Woracek

In this paper, we show that for each lattice basis, there exists an equivalent basis which we describe as ``strongly reduced''. We show that bases reduced in this manner exhibit rather ``short'' basis vectors, that is, the length of the…

Number Theory · Mathematics 2023-05-02 Christian Porter

We prove an analogue for holonomic DQ-modules of the codimension-three conjecture for microdifferential modules recently proved by Kashiwara and Vilonen. Our result states that any holonomic DQ-module having a lattice extends uniquely…

Algebraic Geometry · Mathematics 2014-12-03 Francois Petit

Let $\Lambda$ be any integral lattice in Euclidean space. It has been shown that for every integer $n>0$, there is a hypersphere that passes through exactly $n$ points of $\Lambda$. Using this result, we introduce new lattice invariants and…

Combinatorics · Mathematics 2020-02-27 Ryota Hayasaka , Tsuyoshi Miezaki , Masahiko Toki

A lattice point in $\mathbb{R}^2$ is a point $(x,y)$ with $x,y\in\mathbb{Z}$, and a lattice triangle is a triangle whose three vertices are all lattice points. We investigate the integers $k$ with the property that if $T$ is a lattice…

Combinatorics · Mathematics 2025-01-28 Eddy Li , Dana Paquin

We investigate whether the set of subfit elements of a distributive semilattice is an ideal. This question was raised by the second author at the BLAST conference in 2022. We show that in general it has a negative solution, however if the…

General Topology · Mathematics 2025-03-26 Guram Bezhanishvili , James Madden , M. Andrew Moshier , Marcus Tressl , Joanne Walters-Wayland

Let $L$ be a lattice of finite length and let $d$ denote the minimum path length metric on the covering graph of $L$. For any $\xi=(x_1,\dots,x_k)\in L^k$, an element $y$ belonging to $L$ is called a median of $\xi$ if the sum…

Rings and Algebras · Mathematics 2019-11-07 Gábor Czédli , Robert C. Powers , Jeremy M. White

We show that the problem of deciding whether a given Euclidean lattice L has an orthonormal basis is in NP and co-NP. Since this is equivalent to saying that L is isomorphic to the standard integer lattice, this problem is a special form of…

Discrete Mathematics · Computer Science 2019-10-10 Christoph Hunkenschröder

A Hilbert basis is a set of vectors X such that the integer cone (semigroup) generated by X is the intersection of the lattice generated by X with the cone generated by X. Define a graph to be (cut) Hilbert if its set of cuts forms a…

Combinatorics · Mathematics 2014-09-22 Luis Goddyn , Tony Huynh , Tanmay Deshpande

This work presents an extension of the Construction $\pi_A$ lattices proposed in \cite{huang2017construction}, to Hurwitz quaternion integers. This construction is provided by using an isomorphism from a version of the Chinese remainder…

Information Theory · Computer Science 2025-05-23 Juliana G. F. Souza , Sueli I. R. Costa , Cong Ling

A quadratic form f is said to have semigroup property if its values at points of the integer lattice form a semigroup under multiplication. A problem of V. Arnold is to describe all binary integer quadratic forms with semigroup property. If…

Number Theory · Mathematics 2007-05-23 Francesca Aicardi , Vladlen Timorin

For a partially ordered set P, let Co(P) denote the lattice of all order-convex subsets of P. For a positive integer n, we denote by SUB(LO) (resp., SUB(n)) the class of all lattices that can be embedded into a product of lattices of convex…

General Mathematics · Mathematics 2007-05-23 Marina V. Semenova , Friedrich Wehrung

The paper is concerned with the linkedness of the graphs of cubical polytopes. A graph with at least $2k$ vertices is \textit{$k$-linked} if, for every set of $k$ disjoint pairs of vertices, there are $k$ vertex-disjoint paths joining the…

Combinatorics · Mathematics 2023-10-13 Hoa T. Bui , Guillermo Pineda-Villavicencio , Julien Ugon

Let $\mathcal{T}$ be a collection of 3-element subsets $S$ of $\{1, \ldots,n\}$ with the property that if $i<j<k$ and $a<b<c$ are two 3-element subsets in $S$, then there exists an integer sequence $x_1 < x_2 < \cdots < x_n$ such that $x_i,…

Combinatorics · Mathematics 2014-08-19 Fu Liu , Richard P. Stanley

For L a finite lattice, let C(L) denote the set of pairs g = (g_0,g_1) such that g_0 is a lower cover of g_1 and order it as follows: g <= d iff g_0 <= d_0, g_1 <= d_1, but not g_1 <= d_0. Let C(L,g) denote the connected component of g in…

Logic · Mathematics 2008-07-22 Luigi Santocanale