English
Related papers

Related papers: Cyclotomic generating functions, empty weighted co…

200 papers

Cantor sets are constructed from iteratively removing sections of intervals. This process yields a cumulative distribution function (CDF), constructed from the invariant measure associated with their iterated function systems. Under…

Classical Analysis and ODEs · Mathematics 2019-12-12 Allison Byars , Evan Camrud , Steven N. Harding , Sarah McCarty , Keith Sullivan , Eric S. Weber

We study a generating function for the sum over fatgraphs with specified valences of vertices and faces, inversely weighted by the order of their symmetry group. A compact expression is found for general (i.e. non necessarily connected)…

High Energy Physics - Theory · Physics 2007-05-23 P. Di Francesco , C. Itzykson

We study generating functions in the context of Rota-Baxter algebras. We show that exponential generating functions can be naturally viewed in a very special case of complete free commutative Rota-Baxter algebras. This allows us to use free…

Combinatorics · Mathematics 2015-10-15 Nancy Shanshan Gu , Li Guo

For a finite multigraph G, the reliability function of G is the probability R_G(q) that if each edge of G is deleted independantly with probability q then the remaining edges of G induce a connected spanning subgraph of G; this is a…

Combinatorics · Mathematics 2007-05-23 David G. Wagner

We prove congruence relations modulo cyclotomic polynomials for multisums of $q$-factorial ratios, therefore generalizing many well-known $p$-Lucas congruences. Such congruences connect various classical generating series to their…

Combinatorics · Mathematics 2017-01-24 Boris Adamczewski , Jason P. Bell , Éric Delaygue , Frédéric Jouhet

A recent result by Kardo\v{s}, M\'a\v{c}ajov\'a and Zerafa [J. Comb. Theory, Ser. B. 160 (2023) 1--14] related to the famous Berge-Fulkerson conjecture implies that given an arbitrary set of odd pairwise edge-disjoint cycles, say $\mathcal…

We prove exact product formulas for the tiling generating functions of various halved hexagons and quartered hexagons with defects on boundary. Our results generalize the previous work of the first author and the work of Ciucu.

Combinatorics · Mathematics 2022-01-25 Tri Lai , Ranjan Rohatgi

We give a combinatorial proof that the product of a Schubert polynomial by a Schur polynomial is a nonnegative sum of Schubert polynomials. Our proof uses Assaf's theory of dual equivalence to show that a quasisymmetric function of Bergeron…

Combinatorics · Mathematics 2014-05-13 Sami Assaf , Nantel Bergeron , Frank Sottile

By applying Chinese remainder theorem for coprime polynomials and the "creative microscoping" method recently introduced by the author and Zudilin, we establish parametric generalizations of three $q$-supercongruences modulo the fourth…

Number Theory · Mathematics 2019-12-03 Victor J. W. Guo

In this paper, we survey constructions of and nonexistence results on combinatorial/geometric structures which arise from unions of cyclotomic classes of finite fields. In particular, we survey both classical and recent results on…

Combinatorics · Mathematics 2018-09-11 Koji Momihara , Qi Wang , Qing Xiang

Gordon and Wilton recently proved that the double D of a free group F amalgamated along a cyclic subgroup C of F contains a surface group if a generator w of C satisfies a certain 3-manifold theoretic condition, called virtually…

Group Theory · Mathematics 2010-01-13 Sang-hyun Kim

For a simple connected graph $G$, the $Q$-generating function of the numbers $N_k$ of semi-edge walks of length $k$ in $G$ is defined by $W_Q(t)=\sum\nolimits_{k = 0}^\infty {N_k t^k }$. This paper reveals that the $Q$-generating function…

Combinatorics · Mathematics 2014-03-13 Shu-Yu Cui , Gui-Xian Tian

This paper deals with sequences of random variables $X_n$ only taking values in $\{0,\ldots,n\}$. The probability generating functions of such random variables are polynomials of degree $n$. Under the assumption that the roots of these…

Probability · Mathematics 2024-01-18 Benedikt Rednoß , Christoph Thäle

For odd square-free n > 1 the n-th cyclotomic polynomial satisfies an identity of Gauss. There are similar identity of Aurifeuille, Le Lasseur and Lucas. These identities all involve certain polynomials with integer coefficients. We show…

Number Theory · Mathematics 2010-05-03 Richard P. Brent

We analyze Fourier hyperfunction and hyperfunction semigroups with non-densely defined generators and their connections with local convoluted $C$-semigroups. Structural theorems and spectral characterizations give necessary and sufficient…

Functional Analysis · Mathematics 2014-02-04 Marko Kostić , Stevan Pilipović , Daniel Velinov

We introduce a new point of view towards Glaeser's theorem on composite $C^\infty$ functions [Ann. of Math. 1963], with respect to which we can formulate a ``$C^k$ composite function property" that is satisfied by all semiproper real…

alg-geom · Mathematics 2008-02-03 Edward Bierstone , Pierre D. Milman , Wieslaw Pawlucki

Folding subgroups give a way to realize non-simply-laced Coxeter groups as subgroups of simply-laced Coxeter groups. In this paper, we study how folding subgroups of finite and affine type are distributed length-wise by calculating the…

Combinatorics · Mathematics 2026-05-13 Camilo Augusto Villamil Chalarca , Edward Richmond

Starting from the Verma module of U_q sl(2) we consider the evaluation module for affine U_q sl(2) and discuss its crystal limit (q=0). There exists an associated integrable statistical mechanics model on a square lattice defined in terms…

Mathematical Physics · Physics 2012-07-20 Christian Korff

In this paper we prove a series of matching theorems for two sets of Coxeter generators of a finitely generated Coxeter group that identify common features of the two sets of generators. As an application, we describe an algorithm for…

Group Theory · Mathematics 2014-10-01 Michael Mihalik , John Ratcliffe , Steven Tschantz

Compositional graphoids are fundamental discrete structures which appear in probabilistic reasoning, particularly in the area of graphical models. They are semigraphoids which satisfy the Intersection and Composition properties. These…

Information Theory · Computer Science 2026-05-08 Tobias Boege