scholarly journals Lattice Points in Minkowski Sums

10.37236/886 ◽  
2008 ◽  
Vol 15 (1) ◽  
Author(s):  
Christian Haase ◽  
Benjamin Nill ◽  
Andreas Paffenholz ◽  
Francisco Santos

Fakhruddin has proved that for two lattice polygons $P$ and $Q$ any lattice point in their Minkowski sum can be written as a sum of a lattice point in $P$ and one in $Q$, provided $P$ is smooth and the normal fan of $P$ is a subdivision of the normal fan of $Q$. We give a shorter combinatorial proof of this fact that does not need the smoothness assumption on $P$.

Author(s):  
Ansgar Freyer ◽  
Martin Henk

AbstractGardner et al. posed the problem to find a discrete analogue of Meyer’s inequality bounding from below the volume of a convex body by the geometric mean of the volumes of its slices with the coordinate hyperplanes. Motivated by this problem, for which we provide a first general bound, we study in a more general context the question of bounding the number of lattice points of a convex body in terms of slices, as well as projections.


2020 ◽  
Vol 2020 (11) ◽  
Author(s):  
Marieke van Beest ◽  
Antoine Bourget ◽  
Julius Eckhard ◽  
Sakura Schäfer-Nameki

Abstract We derive the structure of the Higgs branch of 5d superconformal field theories or gauge theories from their realization as a generalized toric polygon (or dot diagram). This approach is motivated by a dual, tropical curve decomposition of the (p, q) 5-brane-web system. We define an edge coloring, which provides a decomposition of the generalized toric polygon into a refined Minkowski sum of sub-polygons, from which we compute the magnetic quiver. The Coulomb branch of the magnetic quiver is then conjecturally identified with the 5d Higgs branch. Furthermore, from partial resolutions, we identify the symplectic leaves of the Higgs branch and thereby the entire foliation structure. In the case of strictly toric polygons, this approach reduces to the description of deformations of the Calabi-Yau singularities in terms of Minkowski sums.


Author(s):  
K. S. Gangadharan ◽  
A. E. Ingham

Let r(n) be the number of representations of n as a sum of two squares, d(n) the number of divisors of n, andwhere γ is Euler's constant. Then P(x) is the error term in the problem of the lattice points of the circle, and Δ(x) the error term in Dirichlet's divisor problem, or the problem of the lattice points of the rectangular hyperbola.


2011 ◽  
Vol 172-174 ◽  
pp. 1119-1127
Author(s):  
Tetsuo Mohri

Continuous Displacement Cluster Variation Method is employed to study binary phase equilibria on the two dimensional square lattice with Lennard-Jones type pair potentials. It is confirmed that the transition temperature decreases significantly as compared with the one obtained by conventional Cluster Variation Method. This is ascribed to the distribution of atomic pairs in a wide range of atomic distance, which enables the system to attain the lower free energy. The spatial distribution of atomic species around a Bravais lattice point is visualized. Although the average position of an atom is centred at the Bravais lattice point, the maximum pair probability is not necessarily attained for the pairs located at the neighboring Bravais lattice points. In addition to the real space information, k-space information are calculated in the present study. Among them, the diffuse intensity spectra due to short range ordering and atomic displacement are discussed.


1995 ◽  
Vol 52 (1) ◽  
pp. 137-151 ◽  
Author(s):  
Poh W. Awyong ◽  
Paul R. Scott

We obtain a result about the maximal circumradius of a planar compact convex set having circumcentre O and containing no non-zero lattice points in its interior. In addition, we show that under certain conditions, the set with maximal circumradius is a triangle with an edge containing two lattice points.


1995 ◽  
Vol 05 (04) ◽  
pp. 413-432 ◽  
Author(s):  
ANIL KAUL ◽  
RIDA T. FAROUKI

The Minkowski sum of two plane curves can be regarded as the area generated by sweeping one curve along the other. The boundary of the Minkowski sum consists of translated portions of the given curves and/or portions of a more complicated curve, the “envelope” of translates of the swept curve. We show that the Minkowski-sum boundary is describable as an algebraic curve (or subset thereof) when the given curves are algebraic, and illustrate the computation of its implicit equation. However, such equations are typically of high degree and do not offer a practical basis for tracing the boundary. For the case of polynomial parametric curves, we formulate a simple numerical procedure to address the latter problem, based on constructing the Gauss maps of the given curves and using them to identifying “corresponding” curve segments that are to be summed. This yields a set of discretely-sampled arcs that constitutes a superset of the Minkowski-sum boundary, and can be regarded as a planar graph. To extract the true boundary, we present a method for identifying and “trimming” away extraneous arcs by systematically traversing this graph.


Author(s):  
Puwadet Sutipanya ◽  
Takashi Arai

Abstract The simplest and most time-efficient phase-separation dynamics simulations are carried out on a disordered lattice to calculate the partial structure factors of coarse-grained A-B binary mixtures. The typical coarse-grained phase-separation models use regular lattices and can describe the local concentrations but cannot describe both local density and concentration fluctuations. To introduce fluctuation for local density in the model, the particle positions from a hard sphere fluid model are determined as disordered lattice points for the model. Then we place the local order parameter as the difference of the concentrations of A and B components on each lattice point. The concentration at each lattice point is time-evolved by discrete equations derived from the Cahn-Hilliard equation. From both fluctuations, Bhatia and Thornton’s structure factor can be accurately calculated. The structure factor for concentration fluctuations at the large wavenumber region gives us the correct mean concentrations of the components. Using the mean concentrations, partial structure factors can be converted from three of Bhatia and Thornton’s structure factors. The present model and procedures can provide a means of analysing the structural properties of many materials that exhibit complex morphological changes.


10.37236/484 ◽  
2010 ◽  
Vol 17 (1) ◽  
Author(s):  
Ondřej Bílka ◽  
Kevin Buchin ◽  
Radoslav Fulek ◽  
Masashi Kiyomi ◽  
Yoshio Okamoto ◽  
...  

Recently, Eisenbrand, Pach, Rothvoß, and Sopher studied the function $M(m, n)$, which is the largest cardinality of a convexly independent subset of the Minkowski sum of some planar point sets $P$ and $Q$ with $|P| = m$ and $|Q| = n$. They proved that $M(m,n)=O(m^{2/3}n^{2/3}+m+n)$, and asked whether a superlinear lower bound exists for $M(n,n)$. In this note, we show that their upper bound is the best possible apart from constant factors.


10.37236/5734 ◽  
2018 ◽  
Vol 25 (3) ◽  
Author(s):  
Paul Johnson

We apply lattice point techniques to the study of simultaneous core partitions. Our central observation is that for $a$ and $b$ relatively prime, the abacus construction identifies the set of simultaneous $(a,b)$-core partitions with lattice points in a rational simplex. We apply this result in two main ways: using Ehrhart theory, we reprove Anderson's theorem that there are $(a+b-1)!/a!b!$ simultaneous $(a,b)$-cores; and using Euler-Maclaurin theory we prove Armstrong's conjecture that the average size of an $(a,b)$-core is $(a+b+1)(a-1)(b-1)/24$. Our methods also give new derivations of analogous formulas for the number and average size of self-conjugate $(a,b)$-cores.


Author(s):  
G. R. Everest

AbstractA well-known theorem of Hardy and Littlewood gives a three-term asymptotic formula, counting the lattice points inside an expanding, right triangle. In this paper a generalisation of their theorem is presented. Also an analytic method is developed which enables one to interpret the coefficients in the formula. These methods are combined to give a generalisation of a “heightcounting” formula of Györy and Pethö which itself was a generalisation of a theorem of Lang.


Sign in / Sign up

Export Citation Format

Share Document