English
Related papers

Related papers: Tree Pairs for Algebraic Bieri-Strebel Groups

200 papers

Full binary trees naturally represent commutative non-associative products. There are many important examples of these products: finite-precision floating-point addition and NAND gates, among others. Balance in such a tree is highly…

Discrete Mathematics · Computer Science 2021-08-27 Laura Monroe

We discuss several enumerative results for irreducible polynomials of a given degree and pairs of relatively prime polynomials of given degrees in several variables over finite fields. Two notions of degree, the {\em total degree} and the…

Number Theory · Mathematics 2008-11-26 Xiang-dong Hou , Gary L. Mullen

We determine all values of the parameters for which the cell modules form a standard system, for a class of cellular diagram algebras including partition, Brauer, walled Brauer, Temperley-Lieb and Jones algebras. For this, we develop and…

Representation Theory · Mathematics 2019-02-05 Kevin Coulembier , Ruibin Zhang

An $r$-augmented tree is a rooted tree plus $r$ edges added from each leaf to ancestors. For $d,g,r\in\mathbb{N}$, we construct a bipartite $r$-augmented complete $d$-ary tree having girth at least $g$. The height of such trees must grow…

Combinatorics · Mathematics 2015-05-01 Noga Alon , Alexandr Kostochka , Benjamin Reiniger , Douglas B. West , Xuding Zhu

We introduce higher-order support varieties for pairs of modules over a commutative local complete intersection ring, and give a complete description of which varieties occur as such support varieties. In the context of a group algebra of a…

Commutative Algebra · Mathematics 2015-12-03 Petter Andreas Bergh , David A. Jorgensen

We give a proof for sharp estimate for the number of spanning trees using linear algebra and generalize this bound to multigraphs. In addition, we show that this bound is tight for complete graphs. In addition, we give estimates for number…

Combinatorics · Mathematics 2022-12-01 K. V. Chelpanov

Ergodic theory, Higher order Fourier analysis and the hyper graph regularity method are three possible approaches to Szemer\'edi type theorems in abelian groups. In this paper we develop an algebraic theory that creates a connection between…

Combinatorics · Mathematics 2009-03-06 Balazs Szegedy

Recent work has proven the existence of extreme inbreeding in a European ancestry sample taken from the contemporary UK population \cite{nature_01}. This result brings our attention again to a math problem related to inbreeding family trees…

Populations and Evolution · Quantitative Biology 2021-09-08 C. Jarne , F A. Gómez Albarracín , M. Caruso

The subtrees and BC-subtrees (subtrees where any two leaves are at even distance apart) have been extensively studied in recent years. Such structures, under special constraints on degrees, have applications in many fields. Through an…

Combinatorics · Mathematics 2021-10-08 Yu Yang , Xiao-xiao Li , Meng-yuan Jin , Long Li , Hua Wang , Xiao-Dong Zhang

Spanning trees of complete bipartite graphs exhibit a rich interaction between degree sequences and graph structure. In this paper, we obtain lower bounds on the number of isomorphism classes of spanning trees in $K_{a,b}, 2 \leq a \leq b$…

Combinatorics · Mathematics 2026-03-03 Peter Johnson , Shayne Nochumson

We prove new bounds on the Betti numbers of real varieties and semi-algebraic sets that have a more refined dependence on the degrees of the polynomials defining them than results known before. Our method also unifies several different…

Algebraic Geometry · Mathematics 2017-11-06 Saugata Basu , Anthony Rizzie

We prove that the Brauer algebra, for all parameters for which it is quasi-hereditary, is Ringel dual to a category of representations of the orthosymplectic super group. As a consequence we obtain new and algebraic proofs for some results…

Representation Theory · Mathematics 2019-04-02 Kevin Coulembier

We consider a family of infinite sums of products of Catalan numbers, indexed by trees. We show that these sums are polynomials in $1/\pi$ with rational coefficients; the proof is effective and provides an algorithm to explicitly compute…

Combinatorics · Mathematics 2025-08-01 Alin Bostan , Valentin Féray , Paul Thévenin

We develop the theory of difference algebraic groups in the case where we have finitely many pairwise commuting difference operators. We show that the defining ideal of a difference algebraic group is finitely generated as a difference…

Algebraic Geometry · Mathematics 2026-05-08 Orla McGrath

It is proved that for any finite dimensional representation of a prime order group over the field of rational numbers, polynomial invariants of degree at most $3$ separate the orbits. A result providing an upper degree bound for separating…

Commutative Algebra · Mathematics 2025-07-01 Mátyás Domokos

Two nonzero recursively enumerable (r.e.) degrees $\mathbf{a}$ and $\mathbf{b}$ form a strong minimal pair if $\mathbf{a} \wedge \mathbf{b}=\mathbf{0}$ and $\mathbf{b}\vee \mathbf{x}\geq \mathbf{a}$ for any nonzero r.e. degree…

Logic · Mathematics 2022-11-22 Mingzhong Cai , Yiqun Liu , Yong Liu , Cheng Peng , Yue Yang

We consider the counting problem of the number of \textit{leaf-labeled increasing trees}, where internal nodes may have an arbitrary number of descendants. The set of all such trees is a discrete representation of the genealogies obtained…

Populations and Evolution · Quantitative Biology 2022-11-08 Johannes Wirtz

We show that for any $n\geq5$ there exist connected algebraic subgroups in the Cremona group $\mathrm{Bir}(\mathbb{P}^n)$ that are not contained in any maximal connected algebraic subgroup. Our approach exploits the existence of stably…

Algebraic Geometry · Mathematics 2026-01-14 Andrea Fanelli , Enrica Floris , Susanna Zimmermann

Counting the number of spanning trees in specific classes of graphs has attracted increasing attention in recent years. In this note, we present unified proofs and generalizations of several results obtained in the 2020s. The main method is…

Combinatorics · Mathematics 2025-06-04 Danila Cherkashin , Pavel Prozorov

Given a finite abelian group $G$ and a subset $J\subset G$ with $0\in J$, let $D_{G}(J,N)$ be the maximum size of $A\subset G^{N}$ such that the difference set $A-A$ and $J^{N}$ have no non-trivial intersection. Recently, this extremal…

Combinatorics · Mathematics 2026-01-06 Zixiang Xu , Chi Hoi Yip