English
Related papers

Related papers: Two kinds of hook length formulas for complete $m$…

200 papers

We obtain the maximum sum-connectivity indices of graphs in the set of trees and in the set of unicyclic graphs respectively with given number of vertices and maximum degree, and determine the corresponding extremal graphs. Additionally, we…

Combinatorics · Mathematics 2012-10-19 Zhibin Du , Bo Zhou , Nenad Trinajstic

In four dimensions, a tree-level double-trace Einstein-Yang-Mills (EYM) amplitude with two negative-helicity gluons (the $(g^-,g^-)$-configuration) satisfies a symmetric spanning forest formula, which was derived from the graphic expansion…

High Energy Physics - Theory · Physics 2023-01-04 Chongsi Xie , Yi-Jian Du

The conjecture of Beineke and Harary states that for any two vertices which can be separated by $k$ vertices and $l$ edges for $l\geq 1$ but neither by $k$ vertices and $l-1$ edges nor $k-1$ vertices and $l$ edges there are $k+l$…

Combinatorics · Mathematics 2020-11-18 Sebastian S. Johann , Sven O. Krumke , Manuel Streicher

In this paper weighted endpoint estimates for the Hardy-Littlewood maximal function on {the infinite rooted} $k$-ary tree are provided. Motivated by Naor and Tao the following Fefferman-Stein estimate \[ w\left(\left\{ x\in…

Classical Analysis and ODEs · Mathematics 2020-03-24 Sheldy Ombrosi , Israel P. Rivera-Ríos , Martín D. Safe

In the maximally-helicity-violating (MHV) configuration, tree-level single-trace Einstein-Yang-Mills (EYM) amplitude with one and two gravitons have been shown to satisfy a formula where each graviton splits into a pair of collinear gluons.…

High Energy Physics - Theory · Physics 2025-02-03 Zhirun Li , Yi-Jian Du

We prove that any Riemannian torus of dimension $m$ with unit volume admits $m$ homologically independent closed geodesics whose length product is bounded from above by $m^m$.

Differential Geometry · Mathematics 2016-07-18 Florent Balacheff , Steve Karam

We study the Pieri type formulas for the Schur multiple zeta functions along with those for the Schur polynomials. To formulate these formulas, we introduce a new insertion rule for adding boxes in the Young tableaux and obtain the results…

Number Theory · Mathematics 2022-08-26 Maki Nakasuji , Wataru Takeda

We study that over some types of trees with a given number of vertices, which trees minimize or maximize the total number of subtrees. Trees minimizing (resp. maximizing) the total number of subtrees usually maximize (resp. minimize) the…

Combinatorics · Mathematics 2012-04-30 Shuchao Li , Shujing Wang

Tree-level scattering amplitudes in planar N=4 super Yang-Mills are known to be Yangian-invariant. It has been shown that integrability allows to obtain a general, explicit method to find such invariants. The uplifting of this result to the…

High Energy Physics - Theory · Physics 2017-08-02 Livia Ferro , Tomasz Lukowski , Andrea Orta , Matteo Parisi

We say two spanning trees of a graph are completely independent if their edge sets are disjoint, and for each pair of vertices, the paths between them in each spanning tree do not have any other vertex in common. Pai and Chang constructed…

Combinatorics · Mathematics 2024-12-17 Benedict Randall Shaw

We present various results concerning the two-weight Hardy's inequality on infinite trees. Our main scope is to survey known characterizations (and proofs) for trace measures, as well as to provide some new ones. Also for some of the known…

Classical Analysis and ODEs · Mathematics 2024-03-14 Nicola Arcozzi , Nikolaos Chalmoukis , Matteo Levi , Pavel Mozolyako

The Yule (pure-birth) model is the simplest null model of speciation; each lineage gives rise to a new lineage independently with the same rate $\lambda$. We investigate the expected length of an edge chosen at random from the resulting…

Populations and Evolution · Quantitative Biology 2009-10-29 Mike Steel , Arne Mooers

Linear extensions of posets are important objects in enumerative and algebraic combinatorics that are difficult to count in general. Families of posets like Young diagrams of straight shapes and $d$-complete posets have hook-length product…

Combinatorics · Mathematics 2021-05-07 GaYee Park

The m-Tamari lattice of F. Bergeron is an analogue of the clasical Tamari order defined on objects counted by Fuss-Catalan numbers, such as m-Dyck paths or (m+1)-ary trees. On another hand, the Tamari order is related to the product in the…

Combinatorics · Mathematics 2020-03-23 J. -C. Novelli , J. -Y. Thibon

Professor Cunsheng Ding gave cyclotomic constructions of cyclic codes with length being the product of two primes. In this paper, we study the cyclic codes of length $n=2^e$ and dimension $k=2^{e-1}$. Clearly, Ding's construction is not…

Information Theory · Computer Science 2018-08-21 Binbin Pang , Shixin Zhu , Ping Li

A metric tree ($M$, $d$), also known as $\mathbb{R}$-trees or $T$-theory, is a metric space such that between any two points there is an unique arc and that arc is isometric to an interval in $\mathbb{R}$. In this paper after presenting…

Metric Geometry · Mathematics 2009-02-23 A. G. Aksoy , M. S. Borman , A. L. Westfahl

This paper gives exact formulas for the regularity of edge ideals of edge-weighted integrally closed trees. In addition, we provide some linear upper bounds on the regularity of powers of such ideals.

Commutative Algebra · Mathematics 2024-03-07 Jiaxin Li , Guangjun Zhu , Shiya Duan

We show that tree-level form factors with length-two operators in Yang-Mills-scalar (YMS) theory exhibit structures very similar to scattering amplitudes of gluons and scalars, which leads to new relations between them. Just like…

High Energy Physics - Theory · Physics 2023-03-01 Jin Dong , Song He , Guanda Lin

A classification of quaternary Hermitian self-dual codes of length 20 is given. Using this classification, a classification of extremal quaternary Hermitian self-dual codes of length 22 is also given.

Combinatorics · Mathematics 2012-05-28 Masaaki Harada , Akihiro Munemasa

A $k$-universal permutation, or $k$-superpermutation, is a permutation that contains all permutations of length $k$ as patterns. The problem of finding the minimum length of a $k$-superpermutation has recently received significant attention…

Combinatorics · Mathematics 2020-05-19 Colin Defant , Noah Kravitz , Ashwin Sah