Related papers: Extending orders to types
In this paper we describe a novel a procedure to build a linear order from an arbitrary poset which (i) preserves the original ordering and (ii) allows to extend monotonic and antitonic mappings defined over the original poset to monotonic…
We show that several classes of ordered structures (namely, convex linear orders, layered permutations, and compositions) admit first-order logical limit laws.
We are interested in generalizing part of the theory of ultrafilters on omega to larger cardinals. Here we set the scene for further investigations introducing properties of ultrafilters in strong sense dual to being normal.
We consider a singularly perturbed fourth-order problem with third-order terms on the unit square. With a formal power series approach, we decompose the solution into solutions of reduced (third-order) problems and various layer parts. The…
We investigate the decidability of the definability problem for fragments of first order logic over finite words enriched with modular predicates. Our approach aims toward the most generic statements that we could achieve, which…
Ordered locally convex spaces is an important classes of spaces in the theory of ordered topological vector spaces just as locally convex spaces in the theory of topological vector spaces. Some special classes of ordered locally convex…
We consider evolution algebras and their related substructures: evolution ideals and evolution subalgebras. After exposing some of the concepts related to them in the literature, we explore the order structures that arise in the sets of…
We propose a generic framework for establishing the decidability of a wide range of logical entailment problems (briefly called querying), based on the existence of countermodels that are structurally simple, gauged by certain types of…
We continue the exploration of various aspects of divisibility of ultrafilters, adding one more relation to the picture: multiplicative finite embeddability. We show that it lies between divisibility relations $\mid_M$ and…
Recent work has suggested enhancing Bloom filters by using a pre-filter, based on applying machine learning to model the data set the Bloom filter is meant to represent. Here we model such learned Bloom filters, clarifying what guarantees…
To precondition a large and sparse linear system, two direct methods for approximate factoring of the inverse are devised. The algorithms are fully parallelizable and appear to be more robust than the iterative methods suggested for the…
Uniform preconditioners for operators of negative order discretized by (dis)continuous piecewise polynomials of any order are constructed from a boundedly invertible operator of opposite order discretized by continuous piecewise linears.…
We consider the dimensions of finite type of representations of a partially ordered set, i.e. such that there is only finitely many isomorphism classes of representations of this dimension. We give a criterion for a dimension to be of…
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 develop a categorical framework for reasoning about abstract properties of differentiation, based on the theory of fibrations. Our work encompasses the first-order fragments of several existing categorical structures for differentiation,…
We develop the theory of cofinal types of ultrafilters over measurable cardinals and establish its connections to Galvin's property. We generalize fundamental results from the countable to the uncountable, but often in surprisingly…
We investigate the definability (reducts) lattice of the order of integers and describe a sublattice generated by relations 'between', 'cycle', 'separation', 'neighbor', '1-codirection', 'order' and equality'. Some open questions are…
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 study preorders on (equivalence classes of) maximal chains in the general context of polygonal lattices endowed with suitably nice edge labellings. We show that, given a quotient of polygonal lattices, such edge labellings descend to the…
We study the number of linear extensions of a partial order with a given proportion of comparable pairs of elements, and estimate the maximum and minimum possible numbers. We also consider a random interval partial order on $n$ elements,…