Related papers: Calkin-Wilf tree
A recursive function on a tree is a function in which each leaf has a given value, and each internal node has a value equal to a function of the number of children, the values of the children, and possibly an explicitly specified random…
We study pluricomplex Green functions on algebraic sets. Let $f$ be a proper holomorphic mapping between two algebraic sets. Given a compact set $K$ in the range of $f$, we show how to estimate the pluricomplex Green functions of $K$ and of…
We study k-Schur functions characterized by k-tableaux, proving combinatorial properties such as a k-Pieri rule and a k-conjugation. This new approach relies on developing the theory of k-tableaux, and includes the introduction of a…
New Orlicz Brunn-Minkowski inequalities are established for rigid motion compatible Minkowski valuations of arbitrary degree. These extend classical log-concavity properties of intrinsic volumes and generalize seminal results of Lutwak and…
The structure and properties of possible $q$-Minkowski spaces is discussed, and the corresponding non-commutative differential calculi are developed in detail and compared with already existing proposals. This is done by stressing its…
We give a short proof of the fact that the number of labelled trees on $n$ vertices is $n^{n-2}$. Although many short proofs are known, we have not seen this one before.
The Minkowski function is a crucial tool used in the study of balanced domains and, more generally, quasi-balanced domains in several complex variables. If a quasi-balanced domain is bounded and pseudoconvex then it is well-known that its…
This paper is a short survey about some properties of algebras ob- tained by the Cayley-Dickson process and some of their applications.
Stanley's Tree Isomorphism Conjecture posits that the chromatic symmetric function can distinguish non-isomorphic trees. While already established for caterpillars and other subclasses of trees, we prove the conjecture's validity for a new…
We study certain overlap coefficients appearing in representation theory of the quantum algebra $\U_q(\mathfrak{sl}_2(\C))$. The overlap coefficients can be identified as products of Askey-Wilson functions, leading to an algebraic…
We give conditions characterizing equality in the Minkowski inequality for big divisors on a projective variety. Our results draw on the extensive history of research on Minkowski inequalities in algebraic geometry.
Given an elliptic curve C, we study here $N_k = #C(F_{q^k})$, the number of points of C over the finite field F_{q^k}. This sequence of numbers, as k runs over positive integers, has numerous remarkable properties of a combinatorial flavor…
An $\alpha$-thin tree $T$ of a graph $G$ is a spanning tree such that every cut of $G$ has at most an $\alpha$ proportion of its edges in $T$. The Thin Tree Conjecture proposes that there exists a function $f$ such that for any $\alpha >…
We consider conjugation action of symmetric group on the semigroup of all partial functions and develop a machinery to investigate character formulas and multiplicities. In particular, we determine nilpotent matrices whose orbit under…
In this article we use the Bellman function technique to characterize the measures for which the weighted Hardy's inequality holds on dyadic trees. We enunciate the (dual) Hardy's inequality over the dyadic tree and we use the associated…
We provide a bijection between the set of factorizations, that is, ordered (n-1)-tuples of transpositions in ${\mathcal S}_{n}$ whose product is (12...n), and labelled trees on $n$ vertices. We prove a refinement of a theorem of D\'{e}nes…
In this short note, we revisit Zeilberger's proof of the classical matrix-tree theorem and give a unified concise proof of variants of this theorem, some known and some new.
Using ideas from algebraic topology and statistical mechanics, we generalize Kirchhoff's network and matrix-tree theorems to finite CW complexes of arbitrary dimension. As an application, we give a formula expressing Reidemeister torsion as…
In this paper, we study the multiplicity of the Laplacian eigenvalues of trees. It is known that for trees, integer Laplacian eigenvalues larger than $1$ are simple and also the multiplicity of Laplacian eigenvalue $1$ has been well studied…
We give a descriptive construction of trees for multi-ended graphs, which yields yet another proof of Stallings' theorem on ends of groups. Even though our proof is, in principle, not very different from already existing proofs and it draws…