Related papers: On the link pattern distribution of quarter-turn s…

Link prediction is one of the fundamental problems in network analysis. In many applications, notably in genetics, a partially observed network may not contain any negative examples of absent edges, which creates a difficulty for many…

We prove that triangular configurations are plentiful in large subsets of cartesian squares of finite quasirandom groups from classes having the quasirandom ultraproduct property, for example the class of finite simple groups. This is…

The quantum mechanical transition probability is symmetric. A probabilistically motivated and more general quantum logical definition of the transition probability was introduced in two preceding papers without postulating its symmetry, but…

We prove that the length of any gap in the differential grading of the Khovanov homology of any quasi-alternating link is one. As a consequence, we obtain that the length of any gap in the Jones polynomial of any such link is one. This…

Quantum systems with discrete symmetries can usually be desymmetrized, but this strategy fails when considering transport in open systems with a symmetry that maps different openings onto each other. We investigate the joint probability…

Three complementation-like involutions are constructed on permutations to prove, and in some cases generalize, all remaining fourteen joint symmetric equidistribution conjectures of Lv and Zhang. Further enumerative results are obtained for…

The shrunk loop theorem presented here is an integral identity which facilitates the calculation of the relative probability (or probability amplitude) of any given topology that a free, closed Brownian or Feynman path of a given 'duration'…

We study occurrences of patterns on clusters of size n in random fields on Z^d. We prove that for a given pattern, there is a constant a>0 such that the probability that this pattern occurs at most an times on a cluster of size n is…

The Lovasz Local Lemma (LLL) is a probabilistic tool which has been used to show the existence of a variety of combinatorial structures with good "local" properties. The "LLL-distribution" can be used to show that the resulting structures…

We prove a variant of the Chance-McDuff conjecture for pseudo-rotations: under certain additional conditions, a closed symplectic manifold which admits a Hamiltonian pseudo-rotation must have deformed quantum product and, in particular,…

Quasi-alternating links are a generalization of alternating links. They are homologically thin for both Khovanov homology and knot Floer homology. Recent work of Greene and joint work of the first author with Kofman resulted in the…

We introduce simple conditions ensuring that invariant distributions of a Feller Markov chain on a compact Riemannian manifold are absolutely continuous with a lower semi-continuous, continuous or smooth density with respect to the…

The Union Closed Sets Conjecture states that in every finite, nontrivial set family closed under taking unions there is an element contained in at least half of all the sets of the family. We investigate two new directions with respect to…

A sorting network is a shortest path from 12..n to n..21 in the Cayley graph of the symmetric group S(n) generated by nearest-neighbor swaps. A pattern is a sequence of swaps that forms an initial segment of some sorting network. We prove…

We consider the symmetric binary perceptron model, a simple model of neural networks that has gathered significant attention in the statistical physics, information theory and probability theory communities, with recent connections made to…

We consider the link and three-manifold invariants from arXiv:1912.02063, which are defined in terms of certain non-semisimple finite ribbon categories $\mathcal{C}$ together with a choice of tensor ideal and modified trace. If the ideal is…

The log-rank conjecture is a longstanding open problem with multiple equivalent formulations in complexity theory and mathematics. In its linear-algebraic form, it asserts that the rank and partitioning number of a Boolean matrix are…

The notion of noncrossing linked partition arose from the study of certain transforms in free probability theory. It is known that the number of noncrossing linked partitions of [n+1] is equal to the n-th large Schroder number $r_n$, which…

We study quasi-stationary distribution of the continuous-state branching process with competition introduced in Berestycki, Fittipaldi and Fontbona\ (Probab. Theory Relat. Fields, 2018). This process is constructed as the unique strong…

Conditional on the extended Riemann hypothesis, we show that with high probability, the characteristic polynomial of a random symmetric $\{\pm 1\}$-matrix is irreducible. This addresses a question raised by Eberhard in recent work. The main…