Related papers: Adding linear orders
A polynomial algorithm is obtained for the NP-complete linear ordering problem.
In this paper, using doubly stochastic operators, we have extended the notion of majorization to the space $\ell^p(I)$, where $I$ is assumed to be an infinite set, and then, in the case $p\in (1,+\infty)$, characterize the structure of all…
The notion of bounded expansion captures uniform sparsity of graph classes and renders various algorithmic problems that are hard in general tractable. In particular, the model-checking problem for first-order logic is fixed-parameter…
We investigate the question of whether the restriction of a NIP type $p\in S(B)$ which does not fork over $A\subseteq B$ to $A$ is also NIP, and the analogous question for dp-rank. We show that if $B$ contains a Morley sequence $I$…
We introduce LAM, a subsystem of IMALL2 with restricted additive rules able to manage duplication linearly, called linear additive rules. LAM is presented as the type assignment system for a calculus endowed with copy constructors, which…
A block in a linear order is an equivalence class when factored by the block relation B(x,y), satisfied by elements that are finitely far apart. We show that every computable linear order with dense condensation-type (i.e. a dense…
We introduce the notion of \tau-like partial order, where \tau is one of the linear order types \omega, \omega*, \omega+\omega*, and \zeta. For example, being \omega-like means that every element has finitely many predecessors, while being…
We define a loop to be quantum nullhomotopic if and only if it admits a nonempty quantum set of extensions to the unit disk. We show that the canonical loop in the unit circle is not quantum nullhomotopic, but that every loop in the real…
Refining a result of Erdos and Mays, we give asymptotic series expansions for the functions $A(x)-C(x)$, the count of $n\leq x$ for which every group of order $n$ is abelian (but not all cyclic), and $N(x)-A(x)$, the count of $n\leq x$ for…
In this paper we introduce a very general setting dealing with the superposition of operators of any positive order and provide a systematic study of them. We also provide examples and counterexamples, as well as characterizing properties…
This article deals with the second order linear differential equations with entire coefficients. We prove some results involving conditions on coefficients so that the order of growth of every non-trivial solution is infinite.
We consider a generalization of the elliptic $L^p$-estimate suited for linear operators with non-trivial kernels. A classical result of Schulenberger and Wilcox (Ann. Mat. Pura Appl. (4) 88: 229-305, 1971) shows that if the operator has…
Let $p$ be a prime and $G$ a subgroup of $GL_d(p)$. We define $G$ to be $p$-exceptional if it has order divisible by $p$, but all its orbits on vectors have size coprime to $p$. We obtain a classification of $p$-exceptional linear groups.…
Turing progressions have been often used to measure the proof-theoretic strength of mathematical theories. Turing progressions based on $n$-provability give rise to a $\Pi_{n+1}$ proof-theoretic ordinal. As such, to each theory $U$ we can…
Parallel addition, i.e., addition with limited carry propagation, has been so far studied for complex bases and integer alphabets. We focus on alphabets consisting of integer combinations of powers of the base. We give necessary conditions…
Partially ordered groups, also known as po-groups, are groups with a compatible partial order. Results from M.I. Zajceva and H.-H. Teh are combined in order to provide a full characterisation of linear order extensions of a given order on a…
We show that the new result on H\"older continuity of solutions to a class of nondiagonal elliptic systems with $p$-growth in [2] can be used to improve the $L^q$ theory for such systems.
We introduce ordinal collapsing principles that are inspired by proof theory but have a set theoretic flavor. These principles are shown to be equivalent to iterated $\Pi^1_1$-comprehension and the existence of admissible sets, over weak…
Let T be an NIP L-theory and T' be an enrichment. We give a sufficient condition on T' for the underlying L-type of any definable (respectively invariant) type over a model of T' to be definable (respectively invariant) as an L-type.…
We describe a mathematical structure that can give extensional denotational semantics to higher-order probabilistic programs. It is not limited to discrete probabilities, and it is compatible with integration in a way the models that have…