Related papers: Some questions on entangled linear orders
A coarse space $X$, endowed with a linear order compatible with the coarse structure of $X$, is called linearly ordered. We prove that every linearly ordered coarse space $X$ is locally convex and the asymptotic dimension of $X$ is either…
We give sufficient conditions for a first order expansion of the real line to define the standard model of the monadic second order theory of one successor. Such an expansion does not satisfy any of the combinatorial tameness properties…
Let $T$ be a countable complete first-order theory with a definable, infinite, discrete linear order. We prove that $T$ has continuum-many countable models. The proof is purely first-order, but raises the question of Borel completeness of…
A lattice L is coordinatizable, if it is isomorphic to the lattice L(R) of principal right ideals of some von Neumann regular ring R. This forces L to be complemented modular. All known sufficient conditions for coordinatizability, due…
We give a rigorous formulation of the intuitive idea that a differentiable map should be thesame thing as a locally, or infinitesimally, linear map: just as a linear map respects the operations of addition and multiplication by scalars ina…
An ordered set-partition (or preferential arrangement) of n labeled elements represents a single ``hierarchy''; these are enumerated by the ordered Bell numbers. In this note we determine the number of ``hierarchical orderings'' or…
The class of closed graphs by a linear ordering on their sets of vertices is investigated. A recent characterization of such a class of graphs is analyzed by using tools from the proper interval graph theory.
Quantum entanglement was first recognized as a feature of quantum mechanics in the famous paper of Einstein, Podolsky and Rosen [18]. Recently it has been realized that quantum entanglement is a key ingredient in quantum computation,…
We consider entanglement witnesses arising from positive linear maps which generate exposed extremal rays. We show that every entanglement can be detected by one of these witnesses, and this witness detects a unique set of entanglement…
Order types are a well known abstraction of combinatorial properties of a point set. By Mn\"ev's universality theorem for each semi-algebraic set $V$ there is an order type with a realization space that is \emph{stably equivalent} to $V$.…
An $(a,b)$-difference necklace of length $n$ is a circular arrangement of the integers $0, 1, 2, \ldots , n-1$ such that any two neighbours have absolute difference $a$ or $b$. We prove that, subject to certain conditions on $a$ and $b$,…
Entanglement is known to serve as an order parameter for true topological order in two-dimensional systems. We show how entanglement of disconnected partitions defines topological invariants for one-dimensional topological superconductors.…
A special class of Jordan algebras over a field $F$ of characteristic zero is considered. Such an algebra consists of an $r$-dimensional subspace of the vector space of all square matrices of a fixed order $n$ over $F$. It contains the…
A prime labeling of a graph with $n$ vertices is a labeling of its vertices with distinct integers from $\{1, 2,\ldots , n\}$ in such a way that the labels of any two adjacent vertices are relatively prime. T. Varkey conjectured that ladder…
Automated theorem proving in first-order logic is an active research area which is successfully supported by machine learning. While there have been various proposals for encoding logical formulas into numerical vectors -- from simple…
In the present work, we continue the research initiated in the preprint: V. G. Bardakov, A. L. Iskra, Orders of products of horizontal class transpositions, arXiv:2409.13341, and related to S. Kohl's question on the orders of products of…
Quantum entanglement is a particularly useful characterization of topological orders which lack conventional order parameters. In this work, we study the entanglement in topologically ordered states between two arbitrary spatial regions,…
P\'olya's enumeration theorem is concerned with counting labeled sets up to symmetry. Given a finite group acting on a finite set of labeled elements it states that the number of labeled sets up to symmetry is given by a polynomial in the…
In this paper we develop a theory of monomial preorders, which differ from the classical notion of monomial orders in that they allow ties between monomials. Since for monomial preorders, the leading ideal is less degenerate than for…
A first-order theory is equational if every definable set is a Boolean combination of instances of equations, that is, of formulae such that the family of finite intersections of instances has the descending chain condition. Equationality…