相关论文: Proof of Razumov-Stroganov conjecture for some inf…

Given a strongly stationary Markov chain and a finite set of stopping rules, we prove the existence of a polynomial algorithm which projects the Markov chain onto a minimal Markov chain without redundant information. Markov complexity is…

In this note, we prove a law of large numbers for local patterns in plane partitions with geometric weight, a model introcued by Okounkov and Reshetikhin. Its proof is based on the determinantal structure of the corresponding point process,…

We introduce "book links" as a generalization of braids in open book decompositions; this new class of objects includes both braids and plats as special cases. We then prove a version of Markov's theorem in this general setting by extending…

The main topic of these notes are Markov loops, studied in the context of continuous time Markov chains on discrete state spaces. We refer to [1] and [2] for the short "history" of the subject. In contrast with these references, symmetry is…

We obtain a family of polynomials defined by vanishing conditions and associated to tangles. We study more specifically the case where they are related to a O(n) loop model. We conjecture that their specializations at $z_i=1$ are {\it…

We find previously unknown families of sets which ensure Frankl's conjecture holds for all families that contain them using an algorithmic framework. The conjecture states that for any nonempty union-closed (UC) family there exists an…

The asymptotic probability theory of conjugacy classes of the finite general linear and unitary groups leads to a probability measure on the set of all partitions of natural numbers. A simple method of understanding these measures in terms…

We prove realizability theorems for vector-valued polynomial mappings, real-algebraic sets and compact smooth manifolds by moduli spaces of planar linkages. We also establish a relation between universality theorems for moduli spaces of…

In this paper we consider images of (ordinary) noncommutative polynomials on matrix algebras endowed with a graded structure. We give necessary and sufficient conditions to verify that some multilinear polynomial is a central polynomial, or…

In this paper we first give a one-move version of Markov's braid theorem for knot isotopy in $S^3$ that sharpens the classical theorem. Then a relative version of Markov's theorem concerning a fixed braided portion in the knot. We also…

Stein proved that for each simple plane triangulation H there exists a partitioning of the vertex of H into two subsets each of which induces a forest if and only if the dual H^{*} has a Hamilton cycle. We extend the Stein theorem for…

A wide class of ``counting'' problems have been studied in Computer Science. Three typical examples are the estimation of - (i) the permanent of an $n\times n$ 0-1 matrix, (ii) the partition function of certain $n-$ particle Statistical…

We study the existence and the number of $k$-neighborly reorientations of an oriented matroid. This leads to $k$-variants of McMullen's problem and Roudneff's conjecture, the case $k=1$ being the original statements on complete cells in…

In the first part of this paper we present a theory of proof nets for full multiplicative linear logic, including the two units. It naturally extends the well-known theory of unit-free multiplicative proof nets. A linking is no longer a set…

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…

We present conjectured exact expressions for two types of correlations in the dense O$(n=1)$ loop model on $L\times \infty$ square lattices with periodic boundary conditions. These are the probability that a point is surrounded by $m$ loops…

We give a systematic method of providing numerical evidence for higher order Stark-type conjectures such as (in chronological order) Stark's conjecture over $\mathbb{Q}$, Rubin's conjecture, Popescu's conjecture, and a conjecture due to…

The Rado-Horn theorem provides necessary and sufficient conditions for when a collection of vectors can be partitioned into a fixed number of linearly independent sets. Such partitions exist if and only if every subset of the vectors…

There has been a growing interest in studying online stochastic packing under more general correlation structures, motivated by the complex data sets and models driving modern applications. Several past works either assume correlations are…

We define a graph algebra version of the stationary phase integration over the coadjoint orbits in the Reshetikhin formula for the colored Jones-HOMFLY polynomial. As a result, we obtain a `universal' U(1)-RCC invariant of links in rational…