English
Related papers

Related papers: On lattice point counting in $\Delta$-modular poly…

200 papers

Let $P$ be a polytope with rational vertices. A classical theorem of Ehrhart states that the number of lattice points in the dilations $P(n) = nP$ is a quasi-polynomial in $n$. We generalize this theorem by allowing the vertices of P(n) to…

Combinatorics · Mathematics 2011-09-28 Sheng Chen , Nan Li , Steven V Sam

In this paper, we give an overview of the various general methods in computing the zeta function of an algebraic variety defined over a finite field, with an emphasis on computing the reduction modulo $p^m$ of the zeta function of a…

Number Theory · Mathematics 2007-05-23 Daqing Wan

We study the module $C^r(\mathcal{P})$ of piecewise polynomial functions of smoothness $r$ on a pure $n$-dimensional polytopal complex $\mathcal{P}\subset\mathbb{R}^n$, via an analysis of certain subcomplexes $\mathcal{P}_W$ obtained from…

Commutative Algebra · Mathematics 2014-02-07 Michael DiPasquale

Suppose we are given an $n$-dimensional order-3 symmetric tensor $T \in (\mathbb{R}^n)^{\otimes 3}$ that is the sum of $r$ random rank-1 terms. The problem of recovering the rank-1 components is possible in principle when $r \lesssim n^2$…

Computational Complexity · Computer Science 2023-03-28 Alexander S. Wein

We present a structural resolution to the exact evaluation of the partition function $p_k(n)$, systematically overcoming the limitations of traditional recursive and asymptotic methods. By framing the partition polytope $\mathcal{P}_{n,k}$…

Combinatorics · Mathematics 2026-03-17 Antonio Bonelli

A lattice polytope is "free" (or "empty") if its vertices are the only lattice points it contains. In the context of valuation theory, Klain (1999) proposed to study the functions $\alpha_i(P;n)$ that count the number of free polytopes in…

Combinatorics · Mathematics 2021-02-23 Sebastian Manecke , Raman Sanyal

We consider the integer point transform $\sigma _P (\mathbf{x}) = \sum _{\mathbf{m} \in P\cap \mathbb{Z}^n} \mathbf{x}^\mathbf{m} \in \mathbb C [x_1^{\pm 1},\ldots, x_n^{\pm 1}]$ of a polytope $P\subset \mathbb{R}^n$. We show that if $P$ is…

Combinatorics · Mathematics 2019-04-24 Katharina Jochemko

We consider paths in the plane with $(1,0),$ $(0,1),$ and $(a,b)$-steps that start at the origin, end at height $n,$ and stay to the left of a given non-decreasing right boundary. We show that if the boundary is periodic and has slope at…

Combinatorics · Mathematics 2007-09-27 Joseph P. S. Kung , Anna de Mier , Xinyu Sun , Catherine H. Yan

The notion of root polynomials of a polynomial matrix $P(\lambda)$ was thoroughly studied in [F. Dopico and V. Noferini, Root polynomials and their role in the theory of matrix polynomials, Linear Algebra Appl. 584:37--78, 2020]. In this…

Optimization and Control · Mathematics 2022-10-07 Vanni Noferini , Paul Van Dooren

Brion's Formula realizes the Laurent polynomial of lattice points in a lattice polytope P as the sum of rational functions associated to the vertices of P. In this paper, we consider the special case where P is a generalized permutohedron.…

Combinatorics · Mathematics 2026-05-06 Matthias Beck , Caroline Klivans , Dustin Ross

Let G be a connected, semisimple Lie group with finite center and let K be a maximal compact subgroup. We investigate a method to compute multiplicities of K-types in the discrete series using a rational expression for a generating function…

Representation Theory · Mathematics 2007-05-23 Jeb F. Willenbring , Gregg J. Zuckerman

We develop a meta-algorithm that, given a polynomial (in one or more variables), and a prime p, produces a fast (logarithmic time) algorithm that takes a positive integer n and outputs the number of times each residue class modulo p appears…

Combinatorics · Mathematics 2015-03-09 Shalosh B. Ekhad , N. J. A. Sloane , Doron Zeilberger

We compute the generating function of column-strict plane partitions with parts in {1,2,...,n}, at most c columns, p rows of odd length and k parts equal to n. This refines both, Krattenthaler's ["The major counting of nonintersecting…

Combinatorics · Mathematics 2007-05-23 Ilse Fischer

In Ehrhart theory, the well-known sign pattern problem asks: given a positive integer $d\geq 3$ and integers $1 \leq i_1 < \cdots < i_k \leq d-2$, does there exist a $d$-dimensional integral polytope $\mathcal{P}$ such that in its Ehrhart…

Combinatorics · Mathematics 2026-05-26 Feihu Liu , Sihao Tao , Guoce Xin

A syntactical proof is given that all functions definable in a certain affine linear typed lambda-calculus with iteration in all types are polynomial time computable. The proof provides explicit polynomial bounds that can easily be…

Logic in Computer Science · Computer Science 2007-05-23 Klaus Aehlig , Helmut Schwichtenberg

We show that the generating function $\sum_{n\ge0}M_n\,z^n$ for Motzkin numbers $M_n$, when coefficients are reduced modulo a given power of $2$, can be expressed as a polynomial in the basic series $\sum _{e\ge0} ^{} {z^{4^e}}/(…

Combinatorics · Mathematics 2018-06-26 Christian Krattenthaler , Thomas W. Müller

Let $S(n)$ denote the least primary factor in the primary decomposition of the multiplicative group $M_n = (\Bbb Z/n\Bbb Z)^\times$. We give an asymptotic formula, with order of magnitude $x/(\log x)^{1/2}$, for the counting function of…

Number Theory · Mathematics 2024-03-06 Greg Martin , Chau Nguyen

Let $\mathfrak{p} \subset V$ be a polytope and $\xi \in V_{\mathbb{C}}^*$. We obtain an expression for $I(\mathfrak{p}; \alpha) := \int_{\mathfrak{p}} e^{\langle \alpha, x \rangle} dx$ as a sum of meromorphic functions in $\alpha \in…

Combinatorics · Mathematics 2025-12-09 Carsten Peterson

Let X be a finite set of points in R^n. A polynomial p nonnegative on X can be written as a sum of squares of rational functions modulo the vanishing ideal I(X). From the point of view of applications, such as polynomial optimization, we…

Algebraic Geometry · Mathematics 2014-02-19 Grigoriy Blekherman , João Gouveia , James Pfeiffer

In this article, we study local zeta functions over non-Archimedean locals fields of arbitrary characteristic attached to rational functions and characters $\chi$ of the units of the ring of integers $\mathcal{O}_{K}$, by using an approach…

Number Theory · Mathematics 2020-08-03 M. Bocardo-Gaspar
‹ Prev 1 3 4 5 6 7 10 Next ›