Related papers: Stochastic monotonicity in Young graph and Thoma t…

We determine, up to the equivalence of first-order interdefinability, all structures which are first-order definable in the random partial order. It turns out that these structures fall into precisely five equivalence classes. We achieve…

We propose a generalization of the Poincar\'e-Birkhoff Theorem on area-preserving twist maps to area-preserving twist maps that are random with respect to an ergodic probability measure. The classical theory is a particular instance of the…

We develop the technique of compactified correspondences and homotopies over one-dimensional base schemes, and illuminate the perfectness and the inverting of characteristic assumptions from the celebrating Voevodsky's strict homotopy…

We show that, in contrast to classical random graph models, many real-world complex systems -- including a variety of biological regulatory networks and technological networks such as the internet -- spontaneously self-organize to a richly…

In this paper, various Homological Conjectures are studied for local rings which are locally finitely generated over a discrete valuation ring $V$ of mixed characteristic. Typically, we can only conclude that a particular Conjecture holds…

A general theory is provided delivering convergence of maximal cyclically monotone mappings containing the supports of coupling measures of sequences of pairs of possibly random probability measures on Euclidean space. The theory is based…

We study topological groups of monotonic autohomeomorphisms on a generalized ordered space $L$. We find a condition that is necessary and sufficient for the set of all monotonic autohomeomorphisms on $L$ along with the function composition…

We consider constrained variants of graph homomorphisms such as embeddings, monomorphisms, full homomorphisms, surjective homomorpshims, and locally constrained homomorphisms. We also introduce a new variation on this theme which derives…

In the simple case of a Bernoulli shift on two symbols, zero and one, by permuting the symbols, it is obvious that any two equal entropy shifts are isomorphic. We show that the isomorphism can be realized by a factor that maps a binary…

The transition measure is a foundational concept introduced by Sergey Kerov to represent the shape of a Young diagram as a centered probability measure on the real line. Over a period of decades the transition measure turned out to be an…

Sinai proved that a nonatomic ergodic measure-preserving system has any Bernoulli shift of no greater entropy as a factor. Given a Bernoulli shift, we show that any other Bernoulli shift that is of strictly less entropy and is…

We consider sets and maps defined over an o-minimal structure over the reals, such as real semi-algebraic or subanalytic sets. A {\em monotone map} is a multi-dimensional generalization of a usual univariate monotone function, while the…

We consider a system of weak* closed sets of finite-dimensional distributions. We show that a corresponding system of random variables can be defined on a probability space with a probability measure determined up to some set of measures,…

In this work we employ machine learning to understand structured mathematical data involving finite groups and derive a theorem about necessary properties of generators of finite simple groups. We create a database of all 2-generated…

We describe two aspects of the behaviour of entries of Young tableaux during the application of the Novelli-Pak-Stoyanovskii algorithm. We derive two theorems which both contain a generalized version of a conjecture by Krattenthaler and…

We give a new (inductive) proof of the classical Frobenius--Young correspondence between irreducible complex representations of the symmetric group and Young diagrams, using the new approach, suggested in \cite{OV, VO}, to determining this…

We develop a probabilistic approach to the celebrated Jacobian conjecture, which states that any Keller map (i.e. any polynomial mapping $F\colon \mathbb{C}^n \to \mathbb{C}^n$ whose Jacobian determinant is a nonzero constant) has a…

In this paper we develop the theory of {\it polymorphisms} of measure spaces, which is a generalization of the theory of measure-preserving transformations; we describe the main notions and discuss relations to the theory of Markov…

In the aftermath of the Robertson--Seymour Graph Minor Theorem, Thomas conjectured that the countable graphs are well-quasi-ordered under the minor relation. We prove that this conjecture, when restricted to graphs with no infinite paths…

We introduce a new approach to the study of a system of algebraic equations in the algebraic torus whose Newton polytopes have sufficiently general relative positions. Our method is based on the theory of Parshin's residues and tame symbols…