English
Related papers

Related papers: Cyclotomic generating functions, empty weighted co…

200 papers

We study two families of cyclotomic graphs and perfect codes in them. They are Cayley graphs on the additive group of $\mathbb{Z}[\zeta_m]/A$, with connection sets $\{\pm (\zeta_m^i + A): 0 \le i \le m-1\}$ and $\{\pm (\zeta_m^i + A): 0 \le…

Combinatorics · Mathematics 2018-09-27 Sanming Zhou

We introduce a new multiplication for the polytope algebra, defined via the intersection of polytopes. After establishing the foundational properties of this intersection product, we investigate finite-dimensional subalgebras that arise…

Combinatorics · Mathematics 2025-05-12 Thomas Wannerer

We show that on quasi-smooth weighted complete intersections of codimension at most 3, any ample Cartier divisor $H$ such that $H-K_X$ is ample admits a nontrivial global section. This is done by proving a generalisation of a numerical…

Algebraic Geometry · Mathematics 2025-01-24 Alessandro Passantino

Plethysm coefficients $\mathsf{a}_{\mu[\nu]}^\lambda$ are the structure coefficients of the plethysm of Schur functions $s_\mu[s_\nu] = \sum_{\lambda} \mathsf{a}_{\mu[\nu]}^\lambda s_\lambda$. We study a bivariate generating function of…

Combinatorics · Mathematics 2026-04-07 Álvaro Gutiérrez , Rosa Orellana , Franco Saliola , Anne Schilling , Mike Zabrocki

We consider Problem 6.94 posed in the book Concrete Mathematics by Graham, Knuth, and Patashnik, and solve it by using bivariate exponential generating functions. The family of recurrence relations considered in the problem contains many…

Combinatorics · Mathematics 2014-03-21 J. Fernando Barbero G. , Jesús Salas , Eduardo J. S. Villaseñor

We seek simple conditions on a pair of labeled posets that determine when the difference of their $(P,\omega)$-partition enumerators is $F$-positive, i.e., positive in Gessel's fundamental basis. This is a quasisymmetric analogue of the…

Combinatorics · Mathematics 2025-09-17 Nathan R. T. Lesnevich , Peter R. W. McNamara

Generalizing Krieger's finite generation theorem, we give conditions for an ergodic system to be generated by a pair of partitions, each required to be measurable with respect to a given sub-algebra, and also required to have a fixed size.

Dynamical Systems · Mathematics 2009-07-08 Nir Avni , Benjamin Weiss

We identify new sufficiency conditions for coercivity of general multivariate polynomials $f\in\mathbb{R}[x]$ which are expressed in terms of their Newton polytopes at infinity and which consist of a system of affine-linear inequalities in…

Optimization and Control · Mathematics 2020-01-13 Tomas Bajbar , Yoshiyuki Sekiguchi

By a choice of new variables the pressure isotropy condition for spherically symmetric static perfect fluid spacetimes can be made a quadratic algebraic equation in one of the two functions appearing in it. Using the other variable as a…

General Relativity and Quantum Cosmology · Physics 2007-05-23 Gyula Fodor

Let M be a smooth and compact moduli space of stable coherent sheaves on a projective surface S with an effective (or trivial) anti-canonical line bundle. We find generators for the cohomology ring of M, with integral coefficients. When S…

Algebraic Geometry · Mathematics 2008-08-25 Eyal Markman

The theory of Mixed-Spin-P (MSP) fields was introduced by Chang-Li-Li-Liu for the quintic threefold, aiming at studying its higher-genus Gromov-Witten invariants. Chang-Guo-Li has successfully applied it to prove conjectures including the…

Algebraic Geometry · Mathematics 2026-02-09 Huai-Liang Chang , Shuai Guo , Jun Li , Wei-Ping Li , Yang Zhou

Given a_1,a_2,...,a_n in Z^d, we examine the set, G, of all non-negative integer combinations of these a_i. In particular, we examine the generating function f(z)=\sum_{b\in G} z^b. We prove that one can write this generating function as a…

Combinatorics · Mathematics 2015-05-08 Herbert E. Scarf , Kevin M. Woods

In this article, I introduce a group-theoretical method to prove positivity of certain linear combinations (with coefficients generally lying in $\mathbb{C}$) of exponential functions under a set of semidefinite linear constraints. The…

Group Theory · Mathematics 2021-12-06 Robert Lin

We define discrete generating series for arbitrary functions \( f \colon \mathbb{Z}^n \rightarrow \mathbb{C} \) and derive functional relations that these series satisfy. For linear difference equations with constant coefficients, we…

Classical Analysis and ODEs · Mathematics 2025-05-01 Vitaly Alekseev , Tom Cuchta , Alexander Lyapin

In this paper we study geometric versions of Burnside's Problem and the von Neumann Conjecture. This is done by considering the notion of a translation-like action. Translation-like actions were introduced by Kevin Whyte as a geometric…

Group Theory · Mathematics 2014-11-11 Brandon Seward

It is well known that Hermitian and non-Hermitian models exhibit distinct physics and require different theoretical tools. In this work, we propose a unified generating-function framework for both classes with generic boundary conditions…

Quantum Physics · Physics 2026-03-30 Hua-Yu Bai , Yang Chen , Guang-Can Guo , Ming Gong , Xi-Feng Ren

We describe a provably complete algorithm for the generation of a tight, possibly exact superset of all combinatorially distinct simple n-facet polytopes in R^d, along with their graphs, f-vectors, and face lattices. The technique applies…

Combinatorics · Mathematics 2009-08-13 Sandeep Koranne , Anand Kulkarni

Buryak, Feigin and Nakajima computed a generating function for a family of partition statistics by using the geometry of the $Z/cZ$ fixed point sets in the Hilbert scheme of points on $C^2$. Loehr and Warrington had already shown how a…

Combinatorics · Mathematics 2024-01-31 Eve Vidalis

For a smooth projective variety equipped with a Chow-K\"unneth (abbr. CK) decomposition, the notions of motivic multiple twist-multiplicativity and multiplicativity defect are introduced to interpret the obstruction to the compatibility of…

Algebraic Geometry · Mathematics 2025-11-04 Ze Xu

Let $B$ be an induced complete bipartite subgraph of $G$ on vertex sets of bipartition $B_{X}$ and $B_{Y}$. The subgraph $B$ is {\it generating} if there exists an independent set $S$ such that each of $S \cup B_{X}$ and $S \cup B_{Y}$ is a…

Computational Complexity · Computer Science 2018-08-31 David Tankus