arXiv math/06082042006-08math.CO

A Combinatorial Analog of a Theorem of F.J.Dyson

Pallavi Jayawant, Peter Wong

备注：: Original version: 7 pages, 2 figures. Revised version: 12 pages, 4 figures, revised proofs. Final revised version: 9 pages, 2 figures, revised proofs

英文摘要：

Tucker's Lemma is a combinatorial analog of the Borsuk-Ulam theorem and the case n=2 was proposed by Tucker in 1945. Numerous generalizations and applications of the Lemma have appeared since then. In 2006 Meunier proved the Lemma in its full generality in his Ph.D. thesis. There are generalizations and extensions of the Borsuk-Ulam theorem that do not yet have combinatorial analogs. In this note, we give a combinatorial analog of a result of Freeman J. Dyson and show that our result is equivalent to Dyson's theorem. As with Tucker's Lemma, we hope that this will lead to generalizations and applications and ultimately a combinatorial analog of Yang's theorem of which both Borsuk-Ulam and Dyson are special cases.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Leading log expansion of combinatorial Dyson Schwinger equations

We study combinatorial Dyson Schwinger equations, expressed in the Hopf algebra of words with a quasi shuffle product. We map them into an algebra of polynomials in one indeterminate L and show that the leading log expansion one obtains with such a mapping are simple power law like expression

2016-02-28hep-thmath.CO

Dyson's new symmetry and generalized Rogers-Ramanujan identities

We present a generalization, which we call (k,m)-rank, of Dyson's notion of rank to integer partitions with k successive Durfee rectangles and give two combinatorial symmetries associated with this new definition. We prove these symmetries bijectively. Using the two symmetries we give a new combinatorial proof of generalized Roger-Ramanujan identities. We also describe the relationship between (k,m)-rank and Garvan's k-rank.

2006-07-05math.CO

A simple proof of the Zeilberger-Bressoud q-Dyson theorem

As an application of the Combinatorial Nullstellensatz, we give a short polynomial proof of the q-analogue of Dyson's conjecture formulated by Andrews and first proved by Zeilberger and Bressoud.

2012-11-28math.CO

Some Observations on Dyson's New Symmetries of Partitions

We utilize Dyson's concept of the adjoint of a partition to derive an infinite family of new polynomial analogues of Euler's Pentagonal Number Theorem. We streamline Dyson's bijection relating partitions with crank <= k and those with k in the Rank-Set of partitions. Also, we extend Dyson's adjoint of a partition to MacMahon's ``modular'' partitions with modulus 2. This way we find a new combinatorial proof of Gauss's famous identity. We give a direct combinatorial proof that for n>1 the partitions of n with crank k are equinumerous with partitions of n with crank -k.

2002-04-23math.COmath.NTmath.QA

k-Marked Dyson Symbols and Congruences for Moments of Cranks

By introducing $k$-marked Durfee symbols, Andrews found a combinatorial interpretation of $2k$-th symmetrized moment $η_{2k}(n)$ of ranks of partitions of $n$. Recently, Garvan introduced the $2k$-th symmetrized moment $μ_{2k}(n)$ of cranks of partitions of $n$ in the study of the higher-order spt-function $spt_k(n)$. In this paper, we give a combinatorial interpretation of $μ_{2k}(n)$. We introduce $k$-marked Dyson symbols based on a representation of ordinary partitions given by Dyson, and we show that $μ_{2k}(n)$ equals the number of $(k+1)$-marked Dyson symbols of $n$. We then introduce th…

2013-12-07math.COmath.NT

Some combinatorial interpretations in perturbative quantum field theory

This paper will describe how combinatorial interpretations can help us understand the algebraic structure of two aspects of perturbative quantum field theory, namely analytic Dyson-Schwinger equations and periods of scalar Feynman graphs. The particular examples which will be looked at are, a better reduction to geometric series for Dyson-Schwinger equations, a subgraph which yields extra denominator reductions in scalar Feynman integrals, and an explanation of a trick of Brown and Schnetz to get one extra step in the denominator reduction of an important particular graph.

2013-08-21math-phmath.COmath.MP

更多相关论文收起更多论文

树管化与复苏型Dyson-Schwinger方程的组合学

Tree-tubings and the combinatorics of resurgent Dyson-Schwinger equations

该研究提出根树二元管化的组合学方法，为具有单一Mellin变换的Dyson-Schwinger方程提供级数解，并导出适合复苏分析的反常维数微分方程组。

2025-09-12hep-thmath-phmath.CO

Combinatorial identities generated by difference analogs of hyperbolic and trigonometric functions of order $n$

We naturally obtain some combinatorial identities finding the difference analogs of hyperbolic and trigonometric functions of order $n.$ In particular, we obtain the identities connected with the proved in the paper the addition formulas for these analogs.

2017-07-18math.CO

Elliptic and $q$-Analogs of the Fibonomial Numbers

In 2009, Sagan and Savage introduced a combinatorial model for the Fibonomial numbers, integer numbers that are obtained from the binomial coefficients by replacing each term by its corresponding Fibonacci number. In this paper, we present a combinatorial description for the $q$-analog and elliptic analog of the Fibonomial numbers. This is achieved by introducing some $q$-weights and elliptic weights to a slight modification of the combinatorial model of Sagan and Savage.

2020-08-13math.CO

A q-Analog of Dual Sequences with Applications

In the present paper combinatorial identities involving q-dual sequences or polynomials with coefficients q-dual sequences are derived. Further, combinatorial identities for q-binomial coefficients(Gaussian coefficients), q-Stirling numbers and q-Bernoulli numbers and polynomials are deduced.

2006-03-07math.CO

A q-analog of Schläfli and Gould identities on Stirling numbers

Stirling numbers of both kinds are linked to each other via two combinatorial identities due to Schläfli and Gould. Using q-analogs of Stirling numbers defined as inversion generating functions, we provide q-analogs of the two identities. The proof is computational and we leave open the problem of finding a more combinatorial one.

2016-10-10math.CO

Combinatorial theorems relative to a random set

We describe recent advances in the study of random analogues of combinatorial theorems.

2014-05-22math.CO

Combinatorial analogs of topological zeta functions

In this article we introduce a new matroid invariant, a combinatorial analog of the topological zeta function of a polynomial. More specifically we associate to any ranked, atomic meet-semilattice L a rational function Z(L,s), in such a way that when L is the lattice of flats of a complex hyperplane arrangement we recover the usual topological zeta function. The definition is in terms of a choice of a combinatorial analog of resolution of singularities, and the main result is that Z(L,s) does not depend on this choice and depends only on L. Known properties of the topological zeta function pro…

2018-03-15math.AGmath.CO

Weighted Forms of Euler's Theorem

In answer to a question of Andrews about finding combinatorial proofs of two identities in Ramanujan's "Lost" Notebook, we obtain weighted forms of Euler's theorem on partitions with odd parts and distinct parts. This work is inspired by the insight of Andrews on the connection between Ramanujan's identities and Euler's theorem. Our combinatorial formulations of Ramanujan's identities rely on the notion of rooted partitions. Iterated Dyson's map and Sylvester's bijection are the main ingredients in the weighted forms of Euler's theorem.

2005-10-06math.COmath.NT

Superization and (q,t)-specialization in combinatorial Hopf algebras

We extend a classical construction on symmetric functions, the superization process, to several combinatorial Hopf algebras, and obtain analogs of the hook-content formula for the (q,t)-specializations of various bases. Exploiting the dendriform structures yields in particular (q,t)-analogs of the Bjorner-Wachs q-hook-length formulas for binary trees, and similar formulas for plane trees.

2008-03-12math.COmath.RA

A combinatorial description of topological complexity for finite spaces

This paper presents a combinatorial analog of topological complexity for finite spaces. We demonstrate that this coincides with the genuine topological complexity of the original finite space, and constitutes an upper bound for the topological complexity of its order complex.

2019-03-21math.ATmath.CO

Generic combinatorial rigidity of periodic frameworks

We give a combinatorial characterization of generic minimal rigidity for planar periodic frameworks. The characterization is a true analogue of the Maxwell-Laman Theorem from rigidity theory: it is stated in terms of a finite combinatorial object and the conditions are checkable by polynomial time combinatorial algorithms. To prove our rigidity theorem we introduce and develop periodic direction networks and Z2-graded-sparse colored graphs.

2012-10-23math.COmath.GT

The oscillation stability problem for the Urysohn sphere: A combinatorial approach

We study the oscillation stability problem for the Urysohn sphere, an analog of the distortion problem for $\ell_2$ in the context of the Urysohn space $\Ur$. In particular, we show that this problem reduces to a purely combinatorial problem involving a family of countable ultrahomogeneous metric spaces with finitely many distances.

2009-02-27math.COmath.MG

Combinatorial Invariance of Relative R-polynomials in the Hermitian Symmetric Case

We develop a marking system for an analog of Hasse diagrams of intervals $[u,v]$ with $u\leq v$ in a Hermitian symmetric pair $W/W_J$, and use this to create a closed form algorithm for computing relative R-polynomials. The uniform nature of this algorithm allows us to show combinatorial invariance of relative Kazhdan-Lusztig polynomials in the Hermitian symmetric space setting.

2009-11-30math.COmath.RT

Crystal structures for symmetric Grothendieck polynomials

The symmetric Grothendieck polynomials representing Schubert classes in the $K$-theory of Grassmannians are generating functions for semistandard set-valued tableaux. We construct a type $A_n$ crystal structure on these tableaux. This crystal yields a new combinatorial formula for decomposing symmetric Grothendieck polynomials into Schur polynomials. For single-columns and single-rows, we give a new combinatorial interpretation of Lascoux polynomials (K-analogs of Demazure characters) by constructing a K-theoretic analog of crystals with an appropriate analog of a Demazure crystal. We relate o…

2018-11-22math.AGmath.COmath.KT