scholarly journals Periods of Ehrhart Coefficients of Rational Polytopes

10.37236/6059 ◽  
2018 ◽  
Vol 25 (1) ◽  
Author(s):  
Tyrrell B. McAllister ◽  
Hélène O. Rochais
Keyword(s):  
Positive Integer ◽  
Open Problem ◽  
Polynomial Function ◽  
Integer Lattice ◽  
Lattice Points ◽  
Periodic Functions

Let $\mathcal{P} \subset \mathbb{R}^{n}$ be a polytope whose vertices have rational coordinates. By a seminal result of E. Ehrhart, the number of integer lattice points in the $k$th dilate of $\mathcal{P}$ ($k$ a positive integer) is a quasi-polynomial function of $k$ — that is, a "polynomial" in which the coefficients are themselves periodic functions of $k$. It is an open problem to determine which quasi-polynomials are the Ehrhart quasi-polynomials of rational polytopes. As partial progress on this problem, we construct families of polytopes in which the periods of the coefficient functions take on various prescribed values.

scholarly journals New Proof That the Sum of the Reciprocals of Primes Diverges

Mathematics ◽  
2020 ◽  
Vol 8 (9) ◽  
pp. 1414
Author(s):  
Vicente Jara-Vera ◽  
Carmen Sánchez-Ávila
Keyword(s):  
Positive Integer ◽  
Prime Number ◽  
Lattice Points ◽  
Elementary Approach ◽  
Prime Divisors

In this paper, we give a new proof of the divergence of the sum of the reciprocals of primes using the number of distinct prime divisors of positive integer n, and the placement of lattice points on a hyperbola given by n=pr with prime number p. We also offer both a new expression of the average sum of the number of distinct prime divisors, and a new proof of its divergence, which is very intriguing by its elementary approach.

scholarly journals A note on local polynomial functions on commutative semigroups

1982 ◽  
Vol 33 (1) ◽  
pp. 50-53
Author(s):  
P. A. Grossman
Keyword(s):  
Positive Integer ◽  
Universal Algebra ◽  
Polynomial Function ◽  
Polynomial Functions ◽  
Commutative Semigroups ◽  
Local Polynomial ◽  
A Chain

AbstractGiven a universal algebra A, one can define for each positive integer n the set of functions on A which can be “interpolated” at any n elements of A by a polynomial function on A. These sets form a chain with respect to inclusion. It is known for several varieties that many of these sets coincide for all algebras A in the variety. We show here that, in contrast with these results, the coincident sets in the chain can to a large extent be specified arbitrarily by suitably choosing A from the variety of commutative semigroups.

scholarly journals DISTRIBUTION OF INTEGER LATTICE POINTS IN A BALL CENTRED AT A DIOPHANTINE POINT

Mathematika ◽  
2009 ◽  
Vol 56 (1) ◽  
pp. 118-134 ◽  
Author(s):  
Hyunsuk Kang ◽  
Alexander V. Sobolev
Keyword(s):  
Integer Lattice ◽  
Lattice Points

The number of non-homogeneous lattice points in subsets of Rn

1977 ◽  
Vol 82 (2) ◽  
pp. 265-268 ◽  
Author(s):  
E. S. Barnes ◽  
Michael Mather
Keyword(s):  
Integer Lattice ◽  
Lattice Points ◽  
Homogeneous Lattice

Let Zn denote the integer lattice in Rn, let A be a non-singular n × n matrix and ʗ ∈ Rn. Then G = AZn + ʗ is called a grid (non-homogeneous lattice) and its determinant det G is defined to be |det A|.

scholarly journals Separating the k-party communication complexity hierarchy: an application of the Zarankiewicz problem

2011 ◽  
Vol Vol. 13 no. 4 ◽  
Author(s):  
Thomas P. Hayes
Keyword(s):  
Positive Integer ◽  
Open Problem ◽  
Communication Complexity ◽  
60Th Birthday ◽  
Equal Size ◽  
Special Issue ◽  
Algorithms And Complexity ◽  
International Audience ◽  
Zarankiewicz Problem ◽  
Complexity Hierarchy

special issue in honor of Laci Babai's 60th birthday: Combinatorics, Groups, Algorithms, and Complexity International audience For every positive integer k, we construct an explicit family of functions f : \0, 1\(n) -\textgreater \0, 1\ which has (k + 1) - party communication complexity O(k) under every partition of the input bits into k + 1 parts of equal size, and k-party communication complexity Omega (n/k(4)2(k)) under every partition of the input bits into k parts. This improves an earlier hierarchy theorem due to V. Grolmusz. Our construction relies on known explicit constructions for a famous open problem of K. Zarankiewicz, namely, to find the maximum number of edges in a graph on n vertices that does not contain K-s,K-t as a subgraph.

scholarly journals The Hadamard conjecture and integer lattices

1987 ◽  
Vol 43 (2) ◽  
pp. 257-267
Author(s):  
J. McCall ◽  
C. H. C. Little
Keyword(s):  
Integer Lattice ◽  
Lattice Points ◽  
Integer Lattices ◽  
Optimal Set

AbstractLet L be an integer lattice, and S a set of lattice points in L. We say that S is optimal if it minimises the number of rectangular sublattices of L (including degenerate ones) which contain an even number of points in S. We show that the resolution of the Hadamard conjecture is equivalent to the determination of |S| for an optimal set S in a (4s-1) × (4s-1) integer lattice L. We then specialise to the case of 1 × n integer lattices, characterising and enumerating their optimal sets.

scholarly journals Circumradius-diameter and width-inradius relations for lattice constrained convex sets

1999 ◽  
Vol 59 (1) ◽  
pp. 147-152 ◽  
Author(s):  
Poh Wah Awyong ◽  
Paul R. Scott
Keyword(s):  
Lattice Point ◽  
Convex Sets ◽  
Convex Set ◽  
Compact Convex ◽  
Integer Lattice ◽  
Lattice Points ◽  
Compact Convex Set ◽  
Planar Convex ◽  
Rectangular Lattices

Let K be a planar, compact, convex set with circumradius R, diameter d, width w and inradius r, and containing no points of the integer lattice. We generalise inequalities concerning the ‘dual’ quantities (2R − d) and (w − 2r) to rectangular lattices. We then use these results to obtain corresponding inequalities for a planar convex set with two interior lattice points. Finally, we conjecture corresponding results for sets containing one interior lattice point.

scholarly journals The lattice points of a circle

1924 ◽  
Vol 106 (739) ◽  
pp. 478-488 ◽  
Keyword(s):  
Positive Integer ◽  
Lattice Points

1. Let r (x) denote the number of ways in which the positive integer x can be expressed as the sum of two squares (positive, negative or zero), and let R( x ) = Σ 0 ≤ n ≤ x r(x) = Σ 0 ≤ p 2 + q 2 ≤ x 1. Thus R( x ) is the number of “lattice-points” (points whose co-ordinate: p, q are integers, positive, negative or zero) in or on the boundary of the circle with centre at the origin and radius √ x . It is trivial that (1.1) R ( x ) − πx = O ( x ½ ), it has been shown by Hardy and Landau that the relation R ( x ) − πx = O ( x α ) is not true for any constant α < ¼, and it has been known for some time that R ( x ) − πx = O ( x ¼ ).

scholarly journals Clausen’s Series 3F2(1) with Integral Parameter Differences

Symmetry ◽  
2021 ◽  
Vol 13 (10) ◽  
pp. 1783
Author(s):  
Kwang-Wu Chen
Keyword(s):  
Positive Integer ◽  
Closed Form ◽  
Open Problem ◽  
Group Symmetry ◽  
Complex Numbers ◽  
Integral Parameter ◽  
Arbitrary Complex

Ebisu and Iwassaki proved that there are three-term relations for 3F2(1) with a group symmetry of order 72. In this paper, we apply some specific three-term relations for 3F2(1) to partially answer the open problem raised by Miller and Paris in 2012. Given a known value 3F2((a,b,x),(c,x+1),1), if f−x is an integer, then we construct an algorithm to obtain 3F2((a,b,f),(c,f+n),1) in an explicit closed form, where n is a positive integer and a,b,c and f are arbitrary complex numbers. We also extend our results to evaluate some specific forms of p+1Fp(1), for any positive integer p≥2.

Sign in / Sign up

Export Citation Format

Share Document