English
Related papers

Related papers: Short rational generating functions for lattice po…

200 papers

We introduce a presentation of the Chow ring of a matroid by a new set of generators, called "simplicial generators." These generators are analogous to nef divisors on projective toric varieties, and admit a combinatorial interpretation via…

Combinatorics · Mathematics 2025-03-18 Spencer Backman , Christopher Eur , Connor Simpson

We approximate $d$-variate periodic functions in weighted Korobov spaces with general weight parameters using $n$ function values at lattice points. We do not limit $n$ to be a prime number, as in currently available literature, but allow…

Numerical Analysis · Mathematics 2022-09-05 Frances Y. Kuo , Weiwen Mo , Dirk Nuyens

We present a solution to the real multidimensional rational K-moment problem, where K is defined by finitely many polynomial inequalities. More precisely, let S be a finite set of real polynomials in X=(X_1,...,X_n) such that the…

Algebraic Geometry · Mathematics 2009-10-19 Jaka Cimpric , Murray Marshall , Tim Netzer

A novel basis of discrete analytic polynomials on a rhombic lattice is introduced and the associated convolution product is studied. A class of discrete analytic functions that are rational with respect to this product is also described.

Complex Variables · Mathematics 2025-03-03 Daniel Alpay , Zubayir Kazi , Mariana Tecalero , Dan Volok

We introduce the property of convex normality of rational polytopes and give a dimensionally uniform lower bound for the edge lattice lengths, guaranteeing the property. As an application, we show that if every edge of a lattice d-polytope…

Combinatorics · Mathematics 2011-12-14 Joseph Gubeladze

To every automorphism w of an infinite rooted regular binary tree we associate a two variable generating function \Phi_w that encodes information on the orbit structure of w. We prove that this is a rational function if w can be described…

Group Theory · Mathematics 2014-04-01 Richard Pink

In this paper, we consider linear functionals defined on an unital commutative real algebra A and establish characterizations for moment functionals on compact sets of characters that depend only on the given functional. For example, we…

Functional Analysis · Mathematics 2025-12-09 Dragu Atanasiu

In this paper we prove that the generating series of the Poincare polynomials of quasihomogeneous Hilbert schemes of points in the plane has a beautiful decomposition into an infinite product. We also compute the generating series of the…

Algebraic Geometry · Mathematics 2014-12-23 A. Buryak , B. L. Feigin

It is a fundamental result in commutative algebra and invariant theory that a finitely generated graded module over a commutative finitely generated graded algebra has rational Hilbert series, and consequently the Hilbert series of the…

Rings and Algebras · Mathematics 2017-08-22 M. Domokos , V. Drensky

The theory of positive kernels and associated reproducing kernel Hilbert spaces, especially in the setting of holomorphic functions, has been an important tool for the last several decades in a number of areas of complex analysis and…

Operator Algebras · Mathematics 2016-02-03 Joseph A. Ball , Gregory Marx , Victor Vinnikov

In a recent article a generalization of the binomial distribution associated with a sequence of positive numbers was examined. The analysis of the nonnegativeness of the formal expressions was a key-point to allow to give them a statistical…

Mathematical Physics · Physics 2015-06-04 H. Bergeron , E. M. F. Curado , J. P. Gazeau , Ligia M. C. S. Rodrigues

Certain families of combinatorial objects admit recursive descriptions in terms of generating trees: each node of the tree corresponds to an object, and the branch leading to the node encodes the choices made in the construction of the…

We determine a sharp lower bound for the Hilbert function in degree $d$ of a monomial algebra failing the weak Lefschetz property over a polynomial ring with $n$ variables and generated in degree $d$, for any $d\geq 2$ and $n\geq 3$. We…

Commutative Algebra · Mathematics 2021-07-02 Nasrin Altafi , Mats Boij

In this article, the reproducing kernel Hilbert space [0, 1] is employed for solving a class of third-order periodic boundary value problem by using fitted reproducing kernel algorithm. The reproducing kernel function is built to get fast…

Numerical Analysis · Mathematics 2017-04-18 Asad Freihat , Radwan Abu-Gdairi , Hammad Khalil , Eman Abuteen , Mohammed Al-Smadi , Rahmat Ali Khan

Let X be an affine real algebraic set . We investigate on the theory of algebraically constructible functions on X and the description of the semi-algebraic subsets of X when we replace the polynomial functions on X by some rational…

Algebraic Geometry · Mathematics 2017-12-21 Jean-Philippe Monnier

We derive generalized generating functions for basic hypergeometric orthogonal polynomials by applying connection relations with one free parameter to them. In particular, we generalize generating functions for the Askey-Wilson, continuous…

Classical Analysis and ODEs · Mathematics 2018-06-01 Howard S. Cohl , Roberto S. Costas-Santos , Philbert R. Hwang , Tanay Wakhare

We present a common generalization of counting lattice points in rational polytopes and the enumeration of proper graph colorings, nowhere-zero flows on graphs, magic squares and graphs, antimagic squares and graphs, compositions of an…

Combinatorics · Mathematics 2010-01-24 Matthias Beck , Thomas Zaslavsky

We present an algorithm for growing the denominator $r$ polygons containing a fixed number of lattice points and enumerate such polygons containing few lattice points for small $r$. We describe the Ehrhart quasi-polynomial of a rational…

Combinatorics · Mathematics 2024-12-02 Girtrude Hamm , Johannes Hofscheier , Alexander Kasprzyk

Presburger arithmetic is the first-order theory of the natural numbers with addition (but no multiplication). We characterize sets that can be defined by a Presburger formula as exactly the sets whose characteristic functions can be…

Combinatorics · Mathematics 2015-05-08 Kevin Woods

We describe a polynomial time algorithm for, given an undirected graph G, finding the minimum dimension d such that G may be isometrically embedded into the d-dimensional integer lattice Z^d.

Data Structures and Algorithms · Computer Science 2007-05-23 David Eppstein