相关论文: When a partial Borel order is linearizable
A famous theorem of Dilworth asserts that any finite poset of width $k$ can be decomposed into $k$ chains. We study the following problem: given a Borel poset $P$ of finite width $k$, is it true that it can be decomposed into $k$ Borel…
We classify, up to equivalences, all abelian groups gradings on null-filiform and one-parametric filiform Leibniz algebras. Any grading on a null-filiform Leibniz algebra is toral but there are non-toral gradings on one-parametric filiform…
Structures based on polarities have been used to provide relational semantics for propositional logics that are modelled algebraically by non-distributive lattices with additional operators. This article develops a first order notion of…
In this paper, we are interested in Gaussian versions of the classical Brunn-Minkowski inequality. We prove in a streamlined way a semigroup version of the Ehrard inequality for $m$ Borel or convex sets based on a previous work by Borell.…
Given an analytic equivalence relation, we tend to wonder whether it is Borel. When it is non Borel, there is always the hope it will be Borel on a "large" set -- nonmeager or of positive measure. That has led Kanovei, Sabok and Zapletal to…
We study the reverse mathematics of interval orders. We establish the logical strength of the implications between various definitions of the notion of interval order. We also consider the strength of different versions of the…
The quasi-filiform Lie algebras of nonzero rank are described. The classifications of filiform and quasi-filiform naturally graded algebras are corrected.
We prove that topological isomorphism on procountable groups is not classifiable by countable structures, in the sense of descriptive set theory. In fact, the equivalence relation $\ell_\infty$ expressing that two sequences of reals have a…
We will investigate proof-theoretic and linguistic aspects of first-order linear logic. We will show that adding partial order constraints in such a way that each sequent defines a unique linear order on the antecedent formulas of a sequent…
Semifields are semirings in which every nonzero element has a multiplicative inverse. A rough classification uses the characteristic of the semifield, that is the isomorphism type of the semifield generated by the two neutral elements. For…
We identify a class of linearly ordered topological spaces $X$ that may satisfy the property that $X\times X$ is homeomorphic to $X\times_l X$ or can be embedded into a linearly ordered space with the stated property. We justify the…
Let $K$ be a field, and $A=K[a_1,\ldots ,a_n]$ a solvable polynomial algebra in the sense of [K-RW, {\it J. Symbolic Comput.}, 9(1990), 1--26]. It is shown that if $A$ is an $\mathbb{N}$-graded algebra of $({\cal B},d(~))$-type, then $A$…
We show that every unstable NIP theory admits a V-definable linear quasi-order, over a finite set of parameters. In particular, if the theory is omega-categorical, then it interprets an infinite linear order. This partially answers a…
We introduce the notion of Q-Borel ideals: ideals which are closed under the Borel moves arising from a poset Q. We study decompositions and homological properties of these ideals, and offer evidence that they interpolate between Borel…
A quantitative model of concurrent interaction is introduced. The basic objects are linear combinations of partial order relations, acted upon by a group of permutations that represents potential non-determinism in synchronisation. This…
We classify, up to isomorphism and up to equivalence, division gradings (by abelian groups) on finite-dimensional simple real algebras. Gradings on finite-dimensional simple algebras are determined by division gradings, so our results give…
We prove results on solvability of nonlinear elliptic partial differential systems of principle type of second order. They are consequences of existence of non-radial solutions for nonlinear partial differential systems of Poisson type. As…
The linearization of complex ordinary differential equations is studied by extending Lie's criteria for linearizability to complex functions of complex variables. It is shown that the linearization of complex ordinary differential equations…
When a linear order has an order preserving surjection onto each of its suborders we say that it is strongly surjective. We prove that the set of countable strongly surjective linear orders is complete for the class of sets which are the…
A planar order is a special linear extension of the edge poset (partially ordered set) of a processive plane graph. The definition of a planar order makes sense for any finite poset and is equivalent to the one of a conjugate order. Here it…