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

We give a short and self-contained proof of the Marker-Steinhorn Theorem for o-minimal expansions of ordered groups, based on an analysis of linear orders definable in such structures.

We attempt to prove the Razumov-Stroganov conjecture using a bijectional approach. We have been unsuccessful but we believe the techniques we present can be used to prove the conjecture.

This paper provides some technical results needed in "Formalism for Relative Gromov-Witten Invariants." We study line-bundles on the moduli stacks of relative stable and rubber maps that are used to define relative Gromov-Witten invariants…

We construct different classes of lumpings for a family of Markov chain products which reflect the structure of a given finite poset. We use essentially combinatorial methods. We prove that, for such a product, every lumping can be obtained…

We provide a simple proof of the existence of a planar separator by showing that it is an easy consequence of the circle packing theorem. We also reprove other results on separators, including: (A) There is a simple cycle separator if the…

Markov chains for probability distributions related to matrix product states and 1D Hamiltonians are introduced. With appropriate 'inverse temperature' schedules, these chains can be combined into a random approximation scheme for ground…

We explore some connections between vectors of integers and integer partitions seen as bi-infinite words. This methodology enables us on the one hand to obtain enumerations connecting products of hook lengths and vectors of integers. This…

Semi-algebraic proof systems such as sum-of-squares (SoS) have attracted a lot of attention recently due to their relation to approximation algorithms: constant degree semi-algebraic proofs lead to conjecturally optimal polynomial-time…

We consider the generalization of the P\'olya urn scheme with possibly infinite many colors as introduced in \cite{Th-Thesis, BaTH2014, BaTh2016, BaTh2017}. For countable many colors, we prove almost sure convergence of the urn…

We provide a nonasymptotic analysis of convergence to stationarity for a collection of Markov chains on multivariate state spaces, from arbitrary starting points, thereby generalizing results in [Khare and Zhou Ann. Appl. Probab. 19 (2009)…

We develop a theory of link projections to trivalent spines of 3-manifolds. We prove a Reidemeister Theorem providing a set of combinatorial moves sufficient to relate the projections of isotopic links. We also show that any link admits a…

The total homology of the loop space of the configuration space of ordered distinct n points in R^m has a structure of a Hopf algebra defined by the 4-term relations if m>2. We describe a relation of between the cohomology of this loop…

We state and prove a topological recursion relation that expresses any genus-g Gromov-Witten invariant of a projective manifold with at least a (3g-1)-st power of a cotangent line class in terms of invariants with fewer cotangent line…

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'…

This survey consists of a detailed proof of Markov's Theorem based on Joan Birman's book "Braids, Links, and Mapping Class Groups" and Carlo Petronio's classes. It was part of an exam project in A.Y. 2016/2017 for the course Knot Theory.

Graded posets frequently arise throughout combinatorics, where it is natural to try to count the number of elements of a fixed rank. These counting problems are often $\#\textbf{P}$-complete, so we consider approximation algorithms for…

Every link in R^3 can be represented by a one-vertex ribbon graph. We prove a Markov type theorem on this subset of link diagrams.

We prove the Gromov-Lawson-Rosenberg Conjecture for the group Z/4xZ/4 by computing the connective real k-homology of the classifying space with the Adams spectral sequence and two types of detection theorems for the kernel of the alpha…

This is a short note describing what I believe is a serious gap in Stanfield's proof of Sachs' conjecture that every linklessly embeddable graph has a linear linkless embedding in $\mathbb{R}^3$.

In this paper we study the number of $k$-neighborly reorientations of an oriented matroid, leading to study $k$-Roudneff's conjecture, the case $k=1$ being the original statement conjectured in 1991. We first prove the conjecture for the…