Related papers: Exponentiable linear orders need not be transitive

It is known that different categorial grammars have surface representation in a fragment of first order multiplicative linear logic (MLL1). We show that the fragment of interest is equivalent to the recently introduced extended tensor type…

We establish a central limit theorem (CLT) for families of products of $\epsilon$-independent random variables. We utilize graphon limits to encode the evolution of independence and characterize the limiting distribution. Our framework…

We give a classification of Legendrian torus links. Along the way, we give the first classification of infinite families of Legendrian links where some smooth symmetries of the link cannot be realized by Legendrian isotopies. We also give…

The robustness property of exponential dichotomies refers to the stability of this notion under small linear perturbations. In recent work~\cite{PPX}, the authors have identified a new class of perturbations under which the notion of a…

A linear order $A$ is called strongly surjective if for every non empty suborder $B \preceq A$, there is an epimorphism from $A$ onto $B$ (denoted by $B \trianglelefteq A$). We show, answering some questions of D\'aniel T. Soukup, that…

A finite group is said to have "perfect order classes" if the number of elements of any given order is either zero or a divisor of the order of the group. The purpose of this note is to describe explicitly the finite Hamiltonian groups with…

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…

Using a result of Longo and Xu, we show that the anomaly arising from a cyclic permutation orbifold of order 3 of a holomorphic conformal net $\mathcal A$ with central charge $c=8k$ depends on the "gravitational anomaly" $k\pmod 3$. In…

In this paper we prove that for circulants of squarefree orders Wilson's conjecture hold, that is each nontrivially unstable circulant of such order has Wilson type. We show that actually only criteria (C.1) and (C.4) are needed.

We construct a countable simple theory which, in Keisler's order, is strictly above the random graph (but "barely so") and also in some sense orthogonal to the building blocks of the recently discovered infinite descending chain. As a…

A graph is said to be {\em vertex-transitive non-Cayley} if its full automorphism group acts transitively on its vertices and contains no subgroups acting regularly on its vertices. In this paper, a complete classification of cubic…

We give a counterexample to a conjecture made by Cigler, Jerman and Wojciechowski stating that all posets are conclusive. We also provide combinatorial characterizations for conclusiveness of finite posets and the existence of outer…

In this article we consider the approximation of compact linear operators defined over tensor product Hilbert spaces. Necessary and sufficient conditions on the singular values of the problem under which we can or cannot achieve different…

A continuous linear operator $T:E \to F$ is called strictly singular if it cannot be invertible on any infinite dimensional closed subspace of its domain. In this note we discuss sufficient conditions and consequences of the phenomenon…

It is shown that every connected vertex-transitive graph of order $6p$, where $p$ is a prime, contains a Hamilton path. Moreover, it is shown that, except for the truncation of the Petersen graph, every connected vertex-transitive graph of…

We define a nontrivial mod 2 valued additive concordance invariant defined on the torsion subgroup of the knot concordance group using involutive knot Floer package. For knots not contained in its kernel, we prove that their iterated…

The two main approaches to the study of irreducible representations of orders (via traces and Poisson orders) have so far been applied in a completely independent fashion. We define and study a natural compatibility relation between the two…

The smallest transitive relation < on well-typed normal terms such that if t is a strict subterm of u then t < u and if T is the normal form of the type of t and the term t is not a sort then T < t is well-founded in the type systems of the…

In this article we combinatorially describe the triangles that are present in two types of line arrangements, those which have global cyclicity and those which are infinity type line arrangements. A combinatorial nomenclature has been…

We consider weakly closed transitive algebras of operators containing non-zero compact operators in real Banach spaces (Lomonosov algebras). It is shown that they are naturally divided in three classes: the algebras of real, complex and…