English
Related papers

Related papers: The algebraic method in tree percolation

200 papers

We study the natural labeling of the one dimensional representations for Ariki-Koike algebras at roots of unity. For Hecke algebras of types A and B, some of these representations can be identified with the socle of the Steinberg…

Representation Theory · Mathematics 2015-09-14 Nicolas Jacon

Bootstrap percolation on an arbitrary graph has a random initial configuration, where each vertex is occupied with probability p, independently of each other, and a deterministic spreading rule with a fixed parameter k: if a vacant site has…

Probability · Mathematics 2008-04-26 Jozsef Balogh , Yuval Peres , Gabor Pete

We consider Stanley--Reisner rings $k[x_1,...,x_n]/I(\mc{H})$ where $I(\mc{H})$ is the edge ideal associated to some particular classes of hypergraphs. For instance, we consider hypergraphs that are natural generalizations of graphs that…

Commutative Algebra · Mathematics 2015-10-12 Eric Emtander , Fatemeh Mohammadi , Somayeh Moradi

We consider $K$-semialgebras for a commutative semiring $K$ that are at the same time $\Sigma$-algebras and satisfy certain linearity conditions. When each finite system of guarded polynomial fixed point equations has a unique solution over…

Discrete Mathematics · Computer Science 2015-03-19 Zoltan Esik

We give a sufficient condition for a monomial ideal to have a nonzero Betti number in each multidegree. In the case of facet ideals of simplicial forests, this condition becomes a necessary one and it allows us to characterize Betti…

Commutative Algebra · Mathematics 2017-08-29 Nursel Erey , Sara Faridi

We give an intuitive method--using local, cyclic replica symmetry--to isolate exponential tree decay in truncated (connected) correlations. We give an expansion and use the symmetry to show that all terms vanish, except those displaying…

Mathematical Physics · Physics 2007-06-20 Arthur Jaffe , David Moser

A tree diagram is a tree with positive integral weight on each edge, which is a notion generalized from the Dynkin diagrams of finite-dimensional simple Lie algebras. We introduce two nilpotent Lie algebras and their extended solvable Lie…

Representation Theory · Mathematics 2007-07-02 Xiaoping Xu

There are two seemingly unrelated ideals associated with a simplicial complex \Delta. One is the Stanley-Reisner ideal I_\Delta, the monomial ideal generated by minimal non-faces of \Delta, well-known in combinatorial commutative algebra.…

Commutative Algebra · Mathematics 2013-05-07 Sonja Petrović , Erik Stokes

In this paper, we give a new and efficient algebraic criterion for the pure as well as non-pure shellability of simplicial complex $\Delta$ over [n]. We also give an algebraic characterization of a leaf in a simplicial complex (defined in…

Commutative Algebra · Mathematics 2017-12-15 Imran Anwar , Zunaira Kosar , Shaheen Nazir

We show that finding the classical bound of broad families of Bell inequalities can be naturally framed as the contraction of an associated tensor network, but in tropical algebra, where the sum is replaced by the minimum and the product is…

Quantum Physics · Physics 2026-02-13 Mengyao Hu , Jordi Tura

In this paper we give a fully combinatorial description of the zero entropy periodic patterns on trees. Unlike previously known characterizations of such patterns, our criterion is independent of any particular topological realization of…

Dynamical Systems · Mathematics 2026-03-19 D. Juher , F. Mañosas , D. Rojas

Let $\mathcal T (n, k)$ be the set of the $k$-uniform supertrees with $n$ vertices and $m$ edges, where $k\geq 3$, $n\geq 5$ and $m=\frac{n-1}{k-1}$. % Let $m$ be the number of the edges of the supertrees in $\mathcal T (n, k)$, where…

Combinatorics · Mathematics 2023-08-02 Lou-Jun Yu , Wen-Huan Wang

The definition of $k^{th}$-order empirical entropy of strings is extended to node labelled binary trees. A suitable binary encoding of tree straight-line programs (that have been used for grammar-based tree compression before) is shown to…

Data Structures and Algorithms · Computer Science 2020-05-21 Danny Hucke , Markus Lohrey , Louisa Seelbach Benkner

We introduce generalizations of Aldous' Brownian Continuous Random Tree as scaling limits for multicritical models of discrete trees. These discrete models involve trees with fine-tuned vertex-dependent weights ensuring a k-th root…

Mathematical Physics · Physics 2007-05-23 J. Bouttier , P. Di Francesco , E. Guitter

The present paper studies multiple failure and signature analysis of coherent systems using the theory of monomial ideals. While system reliability has been studied using Hilbert series of monomial ideals, this is not enough to understand…

Commutative Algebra · Mathematics 2015-10-16 Fatemeh Mohammadi , Eduardo Sáenz-de-Cabezón , Henry P. Wynn

In this note we consider monoidal complexes and their associated algebras, called toric face rings. These rings generalize Stanley-Reisner rings and affine monoid algebras. We compute initial ideals of the presentation ideal of a toric face…

Commutative Algebra · Mathematics 2021-05-18 Winfried Bruns , Robert Koch , Tim Roemer

We study monomial cut ideals associated to a graph $G$, which are a monomial analogue of toric cut ideals as introduced by Sturmfels and Sullivant. Primary decompositions, projective dimensions, and Castelnuovo-Mumford regularities are…

Commutative Algebra · Mathematics 2021-12-09 Jürgen Herzog , Masoomeh Rahimbeigi , Tim Römer

We consider matrices on infinite trees which are universal covers of Jacobi matrices on finite graphs. We are interested in the question of the existence of sequences of finite covers whose normalized eigenvalue counting measures converge…

Spectral Theory · Mathematics 2020-11-12 Nir Avni , Jonathan Breuer , Gil Kalai , Barry Simon

We give a short proof of Cayley's tree formula for counting the number of different labeled trees on $n$ vertices. The following nonlinear recursive relation for the number of labeled trees on $n$ vertices is deduced from a combinatorial…

Combinatorics · Mathematics 2022-12-22 Alok Bhushan Shukla

Let $\mathcal{T}^{(p)}_n$ be the set of $p$-ary labeled trees on $\{1,2,\dots,n\}$. A maximal decreasing subtree of an $p$-ary labeled tree is defined by the maximal $p$-ary subtree from the root with all edges being decreasing. In this…

Combinatorics · Mathematics 2022-03-22 Seunghyun Seo , Heesung Shin