中文
相关论文

相关论文: Lattice polytopes with a given $h^*$-polynomial

200 篇论文

Let S_n denote the symmetric group on n letters. We consider the S_n-root lattice A_{n-1} = {(z1,...,zn) in Z^n | z1+...+zn = 0}, where S_n acts on Z^n by permuting the coordinates, and its tensor, symmetric, and exterior squares. For odd…

环与代数 · 数学 2007-05-23 Nicole Lemire , Martin Lorenz

We introduce the general polynomial algebras characterizing a class of higher order superintegrable systems that separate in Cartesian coordinates. The construction relies on underlying polynomial Heisenberg algebras and their defining…

数学物理 · 物理学 2023-07-20 Danilo Latini , Ian Marquette , Yao-Zhong Zhang

Let $\Gamma$ be an irreducible lattice in a product of n infinite irreducible complete Kac-Moody groups of simply laced type over finite fields. We show that if n is at least 3, then each Kac-Moody groups is in fact a simple algebraic group…

群论 · 数学 2013-07-11 Pierre-Emmanuel Caprace , Nicolas Monod

We discuss generalizations of some results on lattice polygons to certain piecewise linear loops which may have a self-intersection but have vertices in the lattice $\mathbb{Z}^2$. We first prove a formula on the rotation number of a…

组合数学 · 数学 2018-02-21 Akihiro Higashitani , Mikiya Masuda

We classify $n$-representation infinite algebras $\Lambda$ of type \~A. This type is defined by requiring that $\Lambda$ has higher preprojective algebra $\Pi_{n+1}(\Lambda) \simeq k[x_1, \ldots, x_{n+1}] \ast G$, where $G \leq…

表示论 · 数学 2024-11-25 Darius Dramburg , Oleksandra Gasanova

In this paper we study admissible polynomials. We establish an estimate for the number of admissible polynomials of degree $n$ with coeffients $a_i$ satisfying $0\leq a_i\leq H$ for a fixed $H$, for $i=0,1,2, \ldots, n-1$. In particular,…

数论 · 数学 2018-09-19 Theophilus Agama

By a 1997 result of R. Freese, an $n$-element lattice has at most $2^{n-1}$ congruences. This motivates us to define the congruence density cd$(L)$ of a finite $n$-element lattice as $|$Con$(L)|/2^{n-1}$, where $|$Con$(L)|$ is the number of…

环与代数 · 数学 2026-02-05 Gábor Czédli

Let $V$ be a real vector space of dimension $n$ and let $M\subset V$ be a lattice. Let $P\subset V$ be an $n$-dimensional polytope with vertices in $M$, and let $\varphi\colon V\rightarrow \CC $ be a homogeneous polynomial function of…

数论 · 数学 2021-12-21 Matthias Beck , Paul E. Gunnells , Evgeny Materov

There is a simple formula for the Ehrhart polynomial of a cyclic polytope. The purpose of this paper is to show that the same formula holds for a more general class of polytopes, lattice-face polytopes. We develop a way of decomposing any…

组合数学 · 数学 2007-05-23 Fu Liu

We prove the Pierce--Birkhoff conjecture for splines, i.e., continuous piecewise polynomials of degree $d$ in $n$ variables on a hyperplane partition of $\mathbb{R}^n$, can be written as a finite lattice combination of polynomials. We will…

代数几何 · 数学 2025-07-18 Zehua Lai , Lek-Heng Lim

A lattice (d, k)-polytope is the convex hull of a set of points in dimension d whose coordinates are integers between 0 and k. Let {\delta}(d, k) be the largest diameter over all lattice (d, k)-polytopes. We develop a computational…

计算几何 · 计算机科学 2017-04-07 Nathan Chadder , Antoine Deza

We introduce multivariate rational generating series called Hall-Littlewood-Schubert ($\mathsf{HLS}_n$) series. They are defined in terms of polynomials related to Hall-Littlewood polynomials and semistandard Young tableaux. We show that…

组合数学 · 数学 2025-04-28 Joshua Maglione , Christopher Voll

We describe a genetic algorithm to find candidates for $h^*$-vectors satisfying given properties in the space of integers vectors of finite length. We use an implementation of such algorithm to find a 52-dimensional lattice polytope having…

组合数学 · 数学 2024-10-25 Gabriele Balletti

Consider a polynomial $f$ with a convenient Newton polytope $P$ and generic complex coefficients. By the global version of the Kouchnirenko formula, the hypersurface $\{f = 0\} \subset \mathbb{C}^n$ has the homotopy type of a bouquet of…

组合数学 · 数学 2025-10-20 Fedor Selyanin

We use the ordinary Euler operator to compute the Ehrhart series for an arbitrary lattice polytope. The resulting formula involves the coefficients of the Ehrhart polynomial, combined via Eulerian numbers. We use this to compute $h^*_{d-1}$…

组合数学 · 数学 2023-03-31 Wayne A. Johnson

We consider in C^n the class of symmetric homogeneous quadratic dynamical systems. We introduce the notion of algebraic integrability for this class. We present a class of symmetric quadratic dynamical systems that are algebraically…

动力系统 · 数学 2013-03-05 Victor M. Buchstaber , Elena Yu. Bunkova

Suppose $\Gamma$ is an arithmetic group defined over a global field $K$, that the $K$-type of $\Gamma$ is $A_n$ with $n \geq 2$, and that the ambient semisimple group that contains $\Gamma$ as a lattice has at least two noncocompact…

群论 · 数学 2015-10-23 Morgan Cesa

Let $g(x)$ be a fixed non-constant complex polynomial. It was conjectured by Schinzel that if $g(h(x))$ has boundedly many terms, then $h(x)\in \C[x]$ must also have boundedly many terms. Solving an older conjecture raised by R\'enyi and by…

数论 · 数学 2015-05-13 Umberto Zannier

We show that there exist absolute constants $\Delta > \delta > 0$ such that, for all $n \geqslant 2$, there exists a polynomial $P$ of degree $n$, with $\pm 1$ coefficients, such that $$\delta\sqrt{n} \leqslant |P(z)| \leqslant…

经典分析与常微分方程 · 数学 2019-07-23 Paul Balister , Béla Bollobás , Robert Morris , Julian Sahasrabudhe , Marius Tiba

This is the first one of a series of papers on association of orientations, lattice polytopes, and abelian group arrangements to graphs. The purpose is to interpret the integral and modular tension polynomials of graphs at zero and negative…

组合数学 · 数学 2007-06-25 Beifang Chen