Related papers: Left absorption in products of countable orders

In this paper we introduce the notion of linear computability as a method of finding the Waring rank of forms. We use this notion to find infinitely many new examples which satisfy Strassen's Conjecture.

Theories of classification distinguish classes with some good structure theorem from those for which none is possible. Some classes (dense linear orders, for instance) are non-classifiable in general, but are classifiable when we consider…

Adjoint logic is a general approach to combining multiple logics with different structural properties, including linear, affine, strict, and (ordinary) intuitionistic logics, where each proposition has an intrinsic mode of truth. It has…

Let $G$ and $H$ be locally compact groups. We will show that each contractive Jordan isomorphism $\Phi\colon L^1(G)\to L^1(H)$ is either an isometric isomorphism or an isometric anti-isomorphism. We will apply this result to study isometric…

This work develops algorithms for non-parametric confidence regions for samples from a univariate distribution whose support is a discrete mesh bounded on the left. We generalize the theory of Learned-Miller to preorders over the sample…

We define graph products of families of pairs of groups and study the question when two such graph products are commensurable. As an application we prove linearity of certain graph products.

The first steps towards linearisation of partial orders and equivalence relations are described. The definitions of partial orders and equivalence relations (on sets) are formulated in a way that is standard in category theory and that…

We consider a class of non-locally compact groups on which one may define a left-invariant, finitely additive measure taking values in some finitely generated extension of the field $\mathbb{R}$ of real numbers. In particular, we recover…

We construct a class of finitely presented groups where the isomorphism problem is solvable but the commensurability problem is unsolvable. Conversely, we construct a class of finitely presented groups within which the commensurability…

Analogical reasoning depends fundamentally on the ability to learn and generalize about relations between objects. We develop an approach to relational learning which, given a set of pairs of objects…

An order-theoretic forest is a countable partial order such that the set of elements larger than any element is linearly ordered. It is an order-theoretic tree if any two elements have an upper-bound. The order type of a branch can be any…

We study the combinatorial equivalence of separable elements in types $A$ and $B$. A bijection is constructed from the set of separable permutations in the symmetric group $S_{n+1}$ to the set of separable signed permutations in the…

Let $N(n)$ denote the number of isomorphism types of groups of order $n$. We consider the integers $n$ that are products of at most $4$ not necessarily distinct primes and exhibit formulas for $N(n)$ for such $n$.

An identity s=t is linear if each variable occurs at most once in each of the terms s and t. Let T be a tolerance relation of an algebra A in a variety defined by a set of linear identities. We prove that there exist an algebra B in the…

We prove a theorem about the derivation algebra of the tensor product of two algebras. As an application, we determine the derivation algebra of the fixed point algebra of the tensor product of two algebras, with respect to the tensor…

A convex subset X of a linear topological space is called compactly convex if there is a continuous compact-valued map $\Phi:X\to exp(X)$ such that $[x,y]\subset\Phi(x)\cup \Phi(y)$ for all $x,y\in X$. We prove that each convex subset of…

We describe derivations and automorphisms of infinite tensor products of matrix algebras. Using this description we show that for a countable--dimensional locally matrix algebra $A$ over a field $\mathbb{F}$ the dimension of the Lie algebra…

For every finite rank k, k>1, we explicitly construct (2k)! left orders on the free group F_k of rank k. Each order is induced by a word of length 2k in which each generator of F_k and its inverse appear exactly once. For each of these…

We exhibit a bijection between recently-introduced combinatorial objects known as valid hook configurations and certain weighted set partitions. When restricting our attention to set partitions that are matchings, we obtain three new…

This paper studies tree-automatic ordinals (or equivalently, well-founded linearly ordered sets) together with the ordinal addition operation +. Informally, these are ordinals such that their elements are coded by finite trees for which the…