Related papers: Some questions on entangled linear orders
In the first part we show a counterexample to a conjecture by Shelah regarding the existence of indiscernible sequences in dependent theories (up to the first inaccessible cardinal). In the second part we discuss generic pairs, and give an…
In this paper, we prove the first-order convergence law for the uniform attachment random graph with almost all vertices having the same degree. In the considered model, vertices and edges are introduced recursively: at time $m+1$ we start…
This work is a continuation of [13]. We study the linear disjointness between higher-order oscillating sequences and nonlinear dynamical systems. Specifically, we prove that any oscillating sequence of order $m=d+k-1$ and any simple…
In this paper we present a new proof of the following 2010 result of Dubickas, Novikas, and Siurys: Let $(a,b)\in \mathbb{Z}^2$ and let $(x_n)_{n\ge 0}$ be the sequence defined by some initial values $x_0$ and $x_1$ and the second order…
An ordered graph is a graph with a total order over its vertices. A linear layout of an ordered graph is a partition of the edges into sets of either non-crossing edges, called stacks, or non-nesting edges, called queues. The stack (queue)…
Given two vectors $u$ and $v$, their outer sum is given by the matrix $A$ with entries $A_{ij} = u_{i} + v_{j}$. If the entries of $u$ and $v$ are increasing and sufficiently generic, the total ordering of the entries of the matrix is a…
In their 2002 article, Ghirardi, Marinatto and Weber have proposed a formal analysis of the entanglement properties for a system consisting of N distinguishable particles. Their analysis leads to the differentiation of three possible…
In this paper I will show that it is relatively consistent with the usual axioms of mathematics (ZFC) together with a strong form of the axiom of infinity (the existence of a supercompact cardinal) that the class of uncountable linear…
A celebrated 1969 theorem of Michael Rabin is that the MSO theory of the real order where the monadic quantifier is allowed only to range over the sets of rational numbers, is decidable. In 1975 Saharon Shelah proved that if the monadic…
We consider linear orders of finite alternatives constructed by aggregating individual preferences. Specifically, we focus on linear orders that respect modified collective preference relations derived from supermajority rules, where…
We introduce a new logic, called \emph{cluster first-order logic}, a restricted fragment of first-order logic specifically designed to study order invariance. An order-invariant formula is one on a vocabulary that contains an order;…
In this short note we discuss the relation between the so-called Off-Diagonal-Long-Range-Order in many-body interacting quantum systems introduced by C. N. Yang in Rev. Mod. Phys. {\bf 34}, 694 (1962) and entanglement. We argue that there…
We find all linear orders $L,L_2$ such that $L\to(\mathbb Z,L_2)^2$. The key is the identification of the orders $L$ such that $L\to(\mathbb Z,\mathbb Z)^1$.
In recent papers we have studied refined enumerations of alternating sign matrices with respect to a fixed set of top and bottom rows. The present paper is a first step towards extending these considerations to alternating sign matrices…
R. Shorten, F. Wirth, O. Mason, K. Wulff and C. King have asked whether a linear switched system is guaranteed to be globally uniformly stable under arbitrary switching if it is known that every trajectory induced by a periodic switching…
We study the generalized symmetry structure of three known discrete nonautonomous equations. One of them is the semidiscrete dressing chain of Shabat. Two others are completely discrete equations defined on the square lattice. The first one…
We show that the existence of a first-order formula separating two monadic second order formulas over countable ordinal words is decidable. This extends the work of Henckell and Almeida on finite words, and of Place and Zeitoun on…
An ordered graph $H$ is a simple graph with a linear order on its vertex set. The corresponding Tur\'an problem, first studied by Pach and Tardos, asks for the maximum number $\text{ex}_<(n,H)$ of edges in an ordered graph on $n$ vertices…
The order polytopes arising from the finite poset were first introduced and studied by Stanley. For any positive integer $d\geq 14$, Liu and Tsuchiya proved that there exists a non-Ehrhart positive order polytope of dimension $d$. They also…
Ordinary differential equations of the first order on the torus have been investigated in detail by H. Poincar\'e and A. Denjoy. The long-standing problem of generalising these results for the equations of the order $k>1$ (or for the…