Related papers: Stability of stretched root systems, root posets, …
The observed architecture of ecological and socio-economic networks differs significantly from that of random networks. From a network science standpoint, non-random structural patterns observed in real networks call for an explanation of…
Let $R$ be a reduced irreducible root system, $h$ its Coxeter number and $m$ a positive integer smaller than $h$. Choose of base of $R$, whence a corresponding height function, and let $R(m)$ be the set of roots whose height is a multiple…
Richard P. Stanley conjectured that finite trees can be distinguished by their chromatic symmetric functions. In this paper, we prove an analogous statement for posets: Finite rooted trees can be distinguished by their order quasisymmetric…
The Kochen-Specker theorem states that a 3-dimensional complex Euclidean space admits a finite configuration of projective lines such that the corresponding quantum observables (the orthogonal projectors) cannot be assigned with 0 and 1…
In this work we introduce a topological method for the search of fixed points and periodic points for continuous maps defined on generalized rectangles in finite dimensional Euclidean spaces. We name our technique "Stretching Along the…
A rooted tree T is a poset whose Hasse diagram is a graph-theoretic tree having a unique minimal element. We study rowmotion on antichains and lower order ideals of T. Recently Elizalde, Roby, Plante and Sagan considered rowmotion on fences…
The notion of stability can be generalised to point processes by defining the scaling operation in a randomised way: scaling a configuration by $t$ corresponds to letting such a configuration evolve according to a Markov branching particle…
We simulate a two-dimensional array of droplets being compressed between two walls. The droplets are adhesive due to an attractive depletion force. As one wall moves toward the other, the droplet array is compressed and eventually induced…
The root locus is an important tool for analysing the stability and time constants of linear finite-dimensional systems as a parameter, often the gain, is varied. However, many systems are modelled by partial differential equations or delay…
In the recent study of infinite root systems, fractal patterns of ball packings were observed while visualizing roots in affine space. In this paper, we show that the observed fractals are exactly the ball packings described by Boyd and…
We say a finite poset $P$ is a tree poset if its Hasse diagram is a tree. Let $k$ be the length of the largest chain contained in $P$. We show that when $P$ is a fixed tree poset, the number of $P$-free set systems in $2^{[n]}$ is…
Rooted, weighted continuum random trees are used to describe limits of sequences of random discrete trees. Formally, they are random quadruples $(\mathcal{T},d,r,p)$, where $(\mathcal{T},d)$ is a tree-like metric space, $r\in\mathcal{T}$ is…
The possible role of growing static order in the dynamical slowing down towards the glass transition has recently attracted considerable attention. On the basis of random first-order transition (RFOT) theory, a new method to measure the…
We analyze a class of spatial random spanning trees built on a realization of a homogeneous Poisson point process of the plane. This tree has a simple radial structure with the origin as its root. We first use stochastic geometry arguments…
In densely-packed two-dimensional systems of growing cells, such as rod-shaped bacteria, a number of experimental and numerical studies report distinct patterns of nematic orientational order in the presence of confinement. So far, these…
Motivated by constructions from applied topology, there has been recent interest in the homological algebra of linear representations of posets, particularly in the context of homological algebra relative to non-standard exact structures. A…
In this work, we present a generalization of extended persistent homology to filtrations of graded sub-groups by defining relative homology in this setting. Our work provides a more comprehensive and flexible approach to get an algebraic…
We study commutative ring structures on the integral span of rooted trees and $n$-dimensional skew shapes. The multiplication in these rings arises from the smash product operation on monoid representations in pointed sets. We interpret…
Topological data analysis can provide insight on the structure of weighted graphs and digraphs. However, some properties underlying a given (di)graph are hardly mappable to simplicial complexes. We introduce \textit{steady} and…
By definition, a rigid graph in $\mathbb{R}^d$ (or on a sphere) has a finite number of embeddings up to rigid motions for a given set of edge length constraints. These embeddings are related to the real solutions of an algebraic system.…