Related papers: On the link pattern distribution of quarter-turn s…
A characteristic polynomial is an important invariant in the field of hyperplane arrangement. For the Linial arrangement of any irreducible root system, Postnikov and Stanley conjectured that all roots of the characteristic polynomial have…
We compute the limit distribution of partial transposes (when both the number and the size of blocks tends to infinity) for a large class of ensembles of unitarily invariant random matrices. Furthermore, it is shown the asymptotic freeness…
We study quasi-stationary distributions and quasi-limiting behavior of Markov chains in general reducible state spaces with absorption. We propose a set of assumptions dealing with particular situations where the state space can be…
In this paper we settle a weak version of a conjecture (i.e. Conjecture 6) by Mills, Robbins and Rumsey in the paper "Self-complementary totally symmetric plane partitions" (J. Combin. Theory Ser. A 42, 277-292). In other words we show that…
In this paper we present a surprisingly general extension of the main result of a paper that appeared in this journal: I. Montes et al., Sklar's theorem in an imprecise setting, Fuzzy Sets and Systems, 278 (2015), 48--66. The main tools we…
We suggest a new random model for links based on meander diagrams and graphs. We then prove that trivial links appear with vanishing probability in this model, no link $L$ is obtained with probability 1, and there is a lower bound for the…
The construction of link polynomials associated with finite dimensional representations of ribbon quasi-Hopf algebras is discussed in terms of the formulation of an appropriate Markov trace. We then show that this Markov trace is invariant…
In this work we continue our study of Fully Packed Loop (FPL) configurations in a triangle. These are certain subgraphs on a triangular subset of the square lattice, which first arose in the study of the usual FPL configurations on a square…
One of the most elusive challenges within the area of topological data analysis is understanding the distribution of persistence diagrams. Despite much effort, this is still largely an open problem. In this paper, we present a series of…
Many seemingly disparate Markov chains are unified when viewed as random walks on the set of chambers of a hyperplane arrangement. These include the Tsetlin library of theoretical computer science and various shuffling schemes. If only…
Predicting missing links in real networks is an important problem in network science to which considerable efforts have been devoted, giving as a result a vast plethora of link prediction methods in the literature. In this work, we take a…
Given a class of objects, a pattern theorem is a powerful result describing their structure. We show that alternating knots exhibit a pattern theorem, and use this result to prove a long-standing conjecture that alternating knots grow rare.…
Using the symplectic geometry of certain manifolds which appear naturally in Lie theory, we define an invariant which assigns a graded abelian group to an oriented link. The relevant manifolds are transverse slices to certain nilpotent…
We consider Markov chains on partially ordered sets that generalize the success-runs and remaining life chains in reliability theory. We find conditions for recurrence and transience and give simple expressions for the invariant…
Recent developments showed that light cone parton distributions can be studied by investigating the large momentum limit of the so-called quasiparton distributions, which are defined in terms of spacelike correlators, and therefore can be…
We introduce a class of links strictly containing quasi-alternating links for which mod 2 reduced Khovanov homology is always thin. We compute the framed instanton homology for double branched covers of such links. Aligning certain dotted…
Conjectured links between the distribution of values taken by the characteristic polynomials of random orthogonal matrices and that for certain families of L-functions at the centre of the critical strip are used to motivate a series of…
We introduce a new class of fractal circle packings in the plane, generalizing the polyhedral packings defined by Kontorovich and Nakamura. The existence and uniqueness of these packings are guaranteed by infinite versions of the…
The set of subsystems of a finite quantum system (with variables in Z(n)) together with logical connectives, is a distributive lattice. With regard to this lattice, the (where P(m) is the projector to) obeys a supermodularity inequality,…
An exchangeable random matrix is a random matrix with distribution invariant under any permutation of the entries. For such random matrices, we show, as the dimension tends to infinity, that the empirical spectral distribution tends to the…