Related papers: Piecewise convex embeddability on linear orders

In this article, we define and study a geometry and an order on the set of partitions of an even number of objects. One of the definitions involves the partition algebra, a structure of algebra on the set of such partitions depending on an…

In this paper we derive strong linear inequalities for sets of the form {(x, q) \in Rd \times R : q \geq Q(x), x \in Rd - int(P)}, where Q(x) : Rd \rightarrow R is a quadratic function, P \subset Rd and "int" denotes interior. Of particular…

Representing lattices L by equivalence relations amounts to embed them into the lattice Part(V) of all partitions of a set V, and has a long history. Here we are concerned with MODULAR lattices L and aim for sets V as small as possible,…

Given a coarse space $(X, \mathcal{E})$, we consider linear orders on $X$ compatible with the coarse structure $\mathcal E$ and explore interplays between these orders and macro-uniform selectors of $(X, \mathcal{E})$.

In this paper we show that if X is an infinite compactum cleavable over an ordinal, then X must be homeomorphic to an ordinal. X must also therefore be a LOTS. This answers two fundamental questions in the area of cleavability. We also…

A structure ${\mathbb Y}$ of a relational language $L$ is called almost chainable iff there are a finite set $F \subset Y$ and a linear order $<$ on the set $Y\setminus F$ such that for each partial automorphism $\varphi$ (i.e., local…

We generalize the "facial weak order" of a finite Coxeter group to a partial order on a set of intervals in a complete lattice. We apply our construction to the lattice of torsion classes of a finite-dimensional algebra and consider its…

Equations over linearly ordered semilattices are studied. For any equation $t(X)=s(X)$ we find irreducible components of its solution set and compute the average number of irreducible components of all equations in $n$ variables.

With a complete residuated lattice $L$ as the truth value table, we extend the definition of sobriety of classical convex spaces to the framework of $L$-convex spaces. We provide a specific construction for the sobrification of an…

We describe a construction of ordered algebraic structures (ordered abelian semigroups, ordered commutative semirings, etc.) and describe applications to codimension-1 laminations. For a suitable ordered semi- algebraic structure $\mathbb…

Fix any $\lambda\in\mathbb{C}$. We say that a set $S\subseteq\mathbb{C}$ is $\lambda$-$convex$ if, whenever $a$ and $b$ are in $S$, the point $(1-\lambda)a+\lambda b$ is also in $S$. If $S$ is also (topologically) closed, then we say that…

We investigate the statement "the order topology of every countable complete linear order is compact" in the framework of reverse mathematics, and we find that the statement's strength depends on the precise formulation of compactness. If…

A sequential piecewise linear programming method is presented where bounded domains of non-convex functions are successively contracted about the solution of a piecewise linear program at each iteration of the algorithm. Although…

We say that a (countably dimensional) topological vector space $X$ is orbital if there is $T\in L(X)$ and a vector $x\in X$ such that $X$ is the linear span of the orbit ${T^nx:n=0,1,...}$. We say that $X$ is strongly orbital if,…

We define a class of $L$-convex-concave subsets of $\mathbb{R}P^3$, where $L$ is a projective line in $\mathbb{R}P^3$. These are sets whose sections by any plane containing $L$ are convex and concavely depend on this plane. We prove a…

We define a class of L-convex-concave subsets of $\Bbb{R}P^n$, where L is a projective subspace of dimension l in $\Bbb{R}P^n$. These are sets whose sections by any (l+1)-dimensional space L' containing L are convex and concavely depend on…

We formalize and study the natural approach of designing convex surrogate loss functions via embeddings, for problems such as classification, ranking, or structured prediction. In this approach, one embeds each of the finitely many…

Let X and Y be finite dimensional normed spaces, F(X,Y) a collection of all mappings from X into Y. A mapping $P\in F(X,Y)$ is said to be piecewise affine if there exists a finite family of convex polyhedral subsets covering X and such that…

We study the degree spectra and reverse-mathematical applications of computably enumerable and co-computably enumerable partial orders. We formulate versions of the chain/antichain principle and ascending/descending sequence principle for…

A topological space $X$ is called resolvable if it contains a dense subset with dense complement. Using only basic principles, we show that whenever the space $X$ has a resolving subset that can be written as an at most countably infinite…