相关论文: Short rational generating functions for lattice po…

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…

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…

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…

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.

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…

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…

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…

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…

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…

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…

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…

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…

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…

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…

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…

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…

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…

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…

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.