Search arXivSearch

arXiv · 1506.02331

On the span of lattice points in a parallelepiped

Abstract

Let $Λ\subset\mathbf{R}^{n}$ be a lattice which contains the integer lattice $\mathbf{Z}^{n}$. We characterize the space of linear functions $\mathbf{R}^{n}\rightarrow\mathbf{R}$ which vanish on the lattice points of $Λ$ lying in the half-open unit cube $[0,1)^{n}$. We also find an explicit formula for the dimension of the linear span of $Λ\cap[0,1)^{n}$. The results in this paper generalize and are based on the Terminal Lemma of Reid, which is in turn based upon earlier work of Morrison and Stevens on the classification of four dimensional isolated Gorenstein terminal cyclic quotient singularities.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Marcel Celaya. 2017-01-11. On the span of lattice points in a parallelepiped. https://doi.org/10.1007/s00493-017-3562-7

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO