中文
相关论文

相关论文: Labeled binary trees, subarrangements of the Catal…

200 篇论文

We study the enumeration problem for different kind of tree parking functions introduced recently, called tree parking functions, tree parking distributions, prime tree parking functions, and prime tree parking distributions, for rooted…

组合数学 · 数学 2020-07-30 Alois Panholzer

We study a basis of the polynomial ring that we call forest polynomials. This family of polynomials is indexed by a combinatorial structure called indexed forests and permits several definitions, one of which involves flagged P-partitions.…

组合数学 · 数学 2023-06-21 Philippe Nadeau , Vasu Tewari

We introduce a nonnegative functional $\mathfrak{S}$ on the space of line arrangements in $\mathbb{P}^2$ that vanishes precisely on free arrangements, obtained as a semicontinuous relaxation of Saito's criterion. Given an arrangement…

代数几何 · 数学 2026-05-07 Tomás S. R. Silva

In 2007 Sami Assaf introduced dual equivalence graphs as a method for demonstrating that a quasisymmetric function is Schur positive. The method involves the creation of a graph whose vertices are weighted by Ira Gessel's fundamental…

组合数学 · 数学 2015-03-13 Austin Roberts

Using the equivalence between Scherk-Schwarz reductions and twisted tori compactifications, we discuss the effective theories obtained by this procedure from M-theory and N =4 type II orientifold constructions with Neveu-Schwarz and…

高能物理 - 理论 · 物理学 2010-04-05 Gianguido Dall'Agata , Sergio Ferrara

Given a Galois extension $L/K$ of number fields, we describe fine distribution properties of Frobenius elements via invariants from representations of finite Galois groups and ramification theory. We exhibit explicit families of extensions…

数论 · 数学 2024-05-15 Daniel Fiorilli , Florent Jouve

The main result of this paper is a far reaching generalization of the completeness result given by V.~Katsnelson in a recent paper [35]. Instead of just using a collection of dilated Gaussians it is shown that the key steps of an earlier…

泛函分析 · 数学 2022-03-22 Hans G. Feichtinger , Anupam Gumber

In this paper, we shall construct a bijection between rook placements on double staircases (introduced by Josuat-Verg\`es in 2017) and increasing binary trees. We introduce two subclasses of rook placements on double staircases, which we…

组合数学 · 数学 2023-01-16 Bishal Deb

Double Hurwitz numbers enumerating weighted $n$-sheeted branched coverings of the Riemann sphere or, equivalently, weighted paths in the Cayley graph of $S_n$ generated by transpositions are determined by an associated weight generating…

数学物理 · 物理学 2018-06-26 Mathieu Guay-Paquet , J. Harnad

We study the combinatorial equivalence of separable elements in types $A$ and $B$. A bijection is constructed from the set of separable permutations in the symmetric group $S_{n+1}$ to the set of separable signed permutations in the…

组合数学 · 数学 2025-10-15 Yong Liao , Yuping Yang , Houyi Yu

We investigate the homology representation of the symmetric group on rank-selected subposets of subword order. We show that the homology module for words of bounded length, over an alphabet of size $n,$ decomposes into a sum of tensor…

表示论 · 数学 2025-09-09 Sheila Sundaram

We give a novel combinatorial interpretation to the perturbative series solutions for a class of Dyson-Schwinger equations. We show how binary tubings of rooted trees with labels from an alphabet on the tubes, and where the labels satisfy…

数学物理 · 物理学 2025-09-16 Michael Borinsky , Gerald V. Dunne , Karen Yeats

We give a Cayley type formula to count the number of spanning trees in the complete r-uniform hypergraph for all r >= 3. Similar to the bijection between spanning trees in complete graphs and Parking functions, we derive a bijection from…

组合数学 · 数学 2007-05-23 Sivaramakrishnan Sivasubramanian

Billey et al. [arXiv:1507.04976] have recently discovered a surprisingly simple formula for the number $a_n(\sigma)$ of leaf-labelled rooted non-embedded binary trees (also known as phylogenetic trees) with $n\geq 1$ leaves, fixed (for the…

组合数学 · 数学 2016-03-08 Éric Fusy

Several hook summation formulae for binary trees have appeared recently in the literature. In this paper we present an analogous formula for unordered increasing trees of size r, which involves r parameters. The right-hand side can be…

组合数学 · 数学 2013-04-22 Valentin Féray , I. P. Goulden

We introduce a new combinatorial object, semistandard increasing decomposition tableau and study its relation to a semistandard decomposition tableau introduced by Kra\'skiewicz and developed by Lam and Serrano. We also introduce…

数学物理 · 物理学 2017-05-19 Keiichi Shigechi

Several classification methods assume that the underlying distributions follow tree-structured graphical models. Indeed, trees capture statistical dependencies between pairs of variables, which may be crucial to attain low classification…

机器学习 · 统计学 2021-05-31 Yaniv Tenzer , Amit Moscovich , Mary Frances Dorn , Boaz Nadler , Clifford Spiegelman

We study the action of the Chevalley involution of a simple complex Lie group G on the set of its weight varieties (i.e. torus quotients of its flag manifolds). We find for torus quotients of Grassmannians (for GL(n)) that we obtain the…

辛几何 · 数学 2008-07-09 Benjamin J. Howard , John J. Millson

Cylindric skew Schur functions, a generalization of skew Schur functions, are closely related to the famous problem finding a combinatorial formula for the 3-point Gromov-Witten invariants of Grassmannian. In this paper, we prove cylindric…

组合数学 · 数学 2017-06-15 Seung Jin Lee

A good range of problems on trees can be described by the following general setting: Given a bilinear map $*:\mathbb R^d\times\mathbb R^d\to\mathbb R^d$ and a vector $s\in\mathbb R^d$, we need to estimate the largest possible absolute value…

组合数学 · 数学 2025-07-15 Vuong Bui