中文
相关论文

相关论文: Lattice polygons and the number 2i+7

200 篇论文

Let $P$ be a partially ordered set. We prove that if $n$ is sufficiently large, then there exists a packing $\mathcal{P}$ of copies of $P$ in the Boolean lattice $(2^{[n]},\subset)$ that covers almost every element of $2^{[n]}$:…

组合数学 · 数学 2019-09-11 Istvan Tomon

The main purpose of this note is to prove an upper bound on the number of lattice points of a centrally symmetric convex body in terms of the successive minima of the body. This bound improves on former bounds and narrows the gap towards a…

度量几何 · 数学 2007-05-23 Martin Henk

In this paper, I compute the inhomogeneous (multi-probability) bond critical surfaces for the (4,6,12) and (3^4,6) lattices using the linearity approximation described in (Scullard and Ziff, J. Stat. Mech. P03021), implemented as a…

无序系统与神经网络 · 物理学 2015-05-27 Christian R. Scullard

Properties of several sorts of lattices of convex subsets of R^n are examined. The lattice of convex sets containing the origin turns out, for n>1, to satisfy a set of identities strictly between those of the lattice of all convex subsets…

度量几何 · 数学 2007-06-13 George M. Bergman

We explore several problems related to ruled polygons. Given a ruling of a polygon $P$, we consider the Reeb graph of $P$ induced by the ruling. We define the Reeb complexity of $P$, which roughly equates to the minimum number of points…

计算几何 · 计算机科学 2017-07-05 Nicholas J. Cavanna , Marc Khoury , Donald R. Sheehy

A convex set with nonempty interior is maximal lattice-free if it is inclusion-maximal with respect to the property of not containing integer points in its interior. Maximal lattice-free convex sets are known to be polyhedra. The precision…

最优化与控制 · 数学 2011-03-28 Gennadiy Averkov , Christian Wagner , Robert Weismantel

We give necessary and sufficient conditions for an integral polynomial without linear factors to be the characteristic polynomial of an isometry of some even, unimodular lattice of given signature. This gives rise to Hasse principle…

数论 · 数学 2021-05-11 Eva Bayer-Fluckiger

We denote by Conc(L) the semilattice of all finitely generated congruences of a lattice L. For varieties (i.e., equational classes) V and W of lattices such that V is contained neither in W nor its dual, and such that every simple member of…

逻辑 · 数学 2014-03-24 Pierre Gillibert

We prove that every indefinite quadratic form with non-negative integer coefficients is the volume polynomial of a pair of lattice polygons. This solves the discrete version of the Heine-Shephard problem for two bodies in the plane. As an…

代数几何 · 数学 2024-10-16 Ivan Soprunov , Jenya Soprunova

We compute the asymptotics of the number of integral quadratic forms with prescribed orthogonal decompositions and, more generally, the asymptotics of the number of lattice points lying in sectors of affine symmetric spaces. A new key…

数论 · 数学 2019-02-18 Alexander Gorodnik , Hee Oh , Nimish Shah

To every $n$-dimensional lens space $L$, we associate a congruence lattice $\mathcal L$ in $\mathbb Z^m$, with $n=2m-1$ and we prove a formula relating the multiplicities of Hodge-Laplace eigenvalues on $L$ with the number of lattice…

微分几何 · 数学 2016-07-20 Emilio A. Lauret , Roberto J. Miatello , Juan Pablo Rossetti

We consider a compact convex body $\mathcal{B}$ in $\mathbb{R}^d$ $(d\geqslant 3)$ with smooth boundary and nonzero Gaussian curvature and prove a new estimate of $P_{\mathcal{B}}(t)$, the remainder in the lattice point problem, which…

数论 · 数学 2010-07-27 Jingwei Guo

In this paper we study the classification problem of convex lattice ploytopes with respect to given volume or given cardinality.

度量几何 · 数学 2011-05-27 Heling Liu , Chuanming Zong

Blind and Mani, and later Kalai, showed that the face lattice of a simple polytope is determined by its graph, namely its $1$-skeleton. Call a vertex of a $d$-polytope \emph{nonsimple} if the number of edges incident to it is more than $d$.…

The paper establishes a correspondence relating two specific classes of complex algebraic K3 surfaces. The first class consists of K3 surfaces polarized by the rank-sixteen lattice H+E_7+E_7. The second class consists of K3 surfaces…

代数几何 · 数学 2010-04-21 Adrian Clingher , Charles F. Doran

This paper proves the following results: Besides parallelograms and centrally symmetric hexagons, there is no other convex domain which can form a two-, three- or four-fold lattice tiling in the Euclidean plane. If a centrally symmetric…

度量几何 · 数学 2019-11-13 Qi Yang , Chuanming Zong

Rudin conjectured that there are never more than c N^(1/2) squares in an arithmetic progression of length N. Motivated by this surprisingly difficult problem we formulate more than twenty conjectures in harmonic analysis, analytic number…

数论 · 数学 2007-05-23 Javier Cilleruelo , Andrew Granville

Schreyer has proved that the graded Betti numbers of a canonical tetragonal curve are determined by two integers $b_1$ and $b_2$, associated to the curve through a certain geometric construction. In this article we prove that in the case of…

代数几何 · 数学 2015-01-14 Wouter Castryck , Filip Cools

In an earlier paper (math.NT/9906019) we showed that any integral unimodular lattice L of rank n which is not isometric with Z^n has a characteristic vector of norm at most n-8. [A "characteristic vector" of L is a vector w in L such that…

数论 · 数学 2007-05-23 Noam D. Elkies

A lattice $\Lambda$ is said to be an extension of a sublattice $L$ of smaller rank if $L$ is equal to the intersection of $\Lambda$ with the subspace spanned by $L$. The goal of this paper is to initiate a systematic study of the geometry…

度量几何 · 数学 2023-12-19 Maxwell Forst , Lenny Fukshansky