English
Related papers

Related papers: A symmetry on weakly increasing trees and multiset…

200 papers

The notion of tree entropy was introduced by the author as a normalized limit of the number of spanning trees in finite graphs, but is defined on random infinite rooted graphs. We give some new expressions for tree entropy; one uses…

Combinatorics · Mathematics 2010-04-27 Russell Lyons

We present a new formula for all single trace tree amplitudes in four dimensional super Yang-Mills coupled to Einstein supergravity. Like the Cachazo-He-Yuan formula, our expression is supported on solutions of the scattering equations, but…

High Energy Physics - Theory · Physics 2016-01-27 Tim Adamo , Eduardo Casali , Kai A. Roehrig , David Skinner

We consider a deformation of Kerov character polynomials, linked to Jack symmetric functions. It has been introduced recently by M. Lassalle, who formulated several conjectures on these objects, suggesting some underlying combinatorics. We…

Combinatorics · Mathematics 2014-08-18 Maciej Dołęga , Valentin Féray

In this paper, three different proofs to a result of Wang, Peng and Yang (2013) which related to the joint mixability of elliptical distributions with the same characteristic generator are present. Moreover, we generalize this result to any…

Statistics Theory · Mathematics 2023-05-12 Chuancun Yin , Dan Zhu

Generalizing a sequence of Lambert, Cayley and Ramanujan, Chapoton has recently introduced a polynomial sequence Q_n:=Q_n(x,y,z,t) defined by Q_1=1, Q_{n+1}=[x+nz+(y+t)(n+y\partial_y)]Q_n. In this paper we prove Chapoton's conjecture on the…

Combinatorics · Mathematics 2011-03-25 Victor J. W. Guo , Jiang Zeng

In this note, we derive and interpret hidden zeros of tree-level amplitudes of various theories, including Yang-Mills, non-linear sigma model, special Galileon, Dirac-Born-Infeld, and gravity, by utilizing universal expansions of tree-level…

High Energy Physics - Theory · Physics 2026-05-05 Hao Huang , Ye Yang , Kang Zhou

Three decades ago, Stanley and Brenti initiated the study of the Kazhdan--Lusztig--Stanley (KLS) functions, putting on common ground several polynomials appearing in algebraic combinatorics, discrete geometry, and representation theory. In…

Combinatorics · Mathematics 2026-05-06 Luis Ferroni , Jacob P. Matherne , Lorenzo Vecchi

We give a combinatorial expansion of the stable Grothendieck polynomials of skew Young diagrams in terms of skew Schur functions, using a new row insertion algorithm for set-valued semistandard tableaux of skew shape. This expansion unifies…

Combinatorics · Mathematics 2020-09-15 Melody Chan , Nathan Pflueger

We determine the special values at positive integers of the spectral zeta function associated with the combinatorial Laplacian on the regular tree. These values admit explicit formulas in terms of certain polynomials, which we show to be…

Combinatorics · Mathematics 2026-03-13 Dylan Müller

This article concerns the antisymmetry, uniqueness, and monotonicity properties of solutions to some elliptic functionals involving weights and a double well potential. In the one-dimensional case, we introduce the continuous odd…

Analysis of PDEs · Mathematics 2017-09-25 Xavier Cabre , Marcello Lucia , Manel Sanchon , Salvador Villegas

A recurring theme in the least squares approach to phylogenetics has been the discovery of elegant combinatorial formulas for the least squares estimates of edge lengths. These formulas have proved useful for the development of efficient…

Combinatorics · Mathematics 2009-11-13 Radu Mihaescu , Lior Pachter

We consider the generating polynomial of the number of rooted trees on the set $\{1,2,\dots,n\}$ counted by the number of descending edges (a parent with a greater label than a child). This polynomial is an extension of the descent…

Combinatorics · Mathematics 2017-11-21 Rafael S. González D'León

The Ward numbers $W(n,k)$ combinatorially enumerate set partitions with block sizes $\geq 2$ and phylogenetic trees (total partition trees). We prove that $W(n,k)$ also counts \emph{increasing Schr\"oder trees} by verifying they satisfy…

Combinatorics · Mathematics 2025-07-22 Elena L. Wang , Guoce Xin

We conjecture an explicit positive combinatorial formula for the expansion of unicellular LLT polynomials in the elementary symmetric basis. This is an analogue of the Shareshian-Wachs conjecture and previously studied by Panova and the…

Combinatorics · Mathematics 2020-04-21 Per Alexandersson

We study some sequences of polynomials that appear when we consider the successive derivatives of the tree function (or Lambert's W function). We show in particular that they are related with a generalization of Cayley trees, called Greg…

Combinatorics · Mathematics 2017-09-13 Matthieu Josuat-Vergès

We introduce two new bases for polynomials that lift monomial and fundamental quasisymmetric functions to the full polynomial ring. By defining a new condition on pipe dreams, called quasi-Yamanouchi, we give a positive combinatorial rule…

Combinatorics · Mathematics 2020-03-05 Sami Assaf , Dominic Searles

Lam, Lee, and Shimozono introduced the double Stanley symmetric functions in their study of the equivariant geometry of the affine Grassmannian. They proved that the associated double Edelman--Greene coefficients, the double Schur expansion…

Combinatorics · Mathematics 2025-12-16 Jack Chen-An Chou , Tianyi Yu

We introduce new estimation methods for a sub-class of the Gaussian scale mixture models for wavelet trees by Wainwright, Simoncelli & Willsky that rely on modern results for composite likelihoods and approximate Bayesian inference. Our…

Statistics Theory · Mathematics 2017-08-14 Robert Dahl Jacobsen , Jesper Møller

The factorization form of the integrands in the Cachazo-He-Yuan (CHY) formalism makes the generalized Kawai-Lewellen-Tye (KLT) relations manifest, thus amplitudes of one theory can be expanded in terms of the amplitudes of another theory.…

High Energy Physics - Theory · Physics 2019-12-18 Bo Feng , Xiaodi Li , Kang Zhou

Quasi-trees generalize trees in that the unique "path" between two nodes may be infinite and have any countable order type. They are used to define the rank-width of a countable graph in such a way that it is equal to the least upper-bound…

Logic in Computer Science · Computer Science 2023-06-22 Bruno Courcelle