English
Related papers

Related papers: Decomposing the real line into everywhere isomorph…

200 papers

Let $G$ be an induced subgraph of the hypercube $Q_k$ for some $k$. We show that if $|G|$ is a power of $2$ then, for sufficiciently large $n$, the vertex set of $Q_n$ can be partitioned into induced copies of $G$. This answers a question…

Combinatorics · Mathematics 2016-11-08 Vytautas Gruslys

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…

Logic · Mathematics 2007-05-23 Wesley Calvert

We introduce a procedure based on computational algebraic geometry to determine whether two algebras are isomorphic. We then apply it to show that if $R$ is a commutative unital ring in which $2$ is not invertible, $G$ is a group of order…

Group Theory · Mathematics 2026-03-31 Leo Margolis , Taro Sakurai

In this paper we put forward the definition of particular subsets on a unital C*-algebra, that we call isocones, and which reduce in the commutative case to the set of continuous non-decreasing functions with real values for a partial order…

Operator Algebras · Mathematics 2014-11-18 Fabien Besnard

Every left-invariant ordering of a group is either discrete, meaning there is a least element greater than the identity, or dense. Corresponding to this dichotomy, the spaces of left, Conradian, and bi-orderings of a group are naturally…

Group Theory · Mathematics 2020-04-29 Adam Clay , Tessa Reimer

Without assuming the field structure on the additive group of real numbers $\mathbb{R}$ with the usual order $<,$ we explore the fact that every proper subgroup of $\mathbb{R}$ is either closed or dense. This property of subgroups of the…

Number Theory · Mathematics 2014-05-21 Jitender Singh

In this paper we demonstrate how to partition the real number line into four subsets which may be reassembled, via "piecewise rigid functions" that preserve Lebesgue measure, into two copies of the line. We then employ a similar process to…

Group Theory · Mathematics 2015-11-05 Shelley Kandola , Sam Vandervelde

In a 2022 paper, Dawsey, Just and the present author prove that the set of integer partitions, taken as a monoid under a partition multiplication operation I defined in my Ph.D. work, is isomorphic to the positive integers as a monoid under…

Number Theory · Mathematics 2026-01-21 Robert Schneider

The toric ideal $I_A$ is splittable if it has a toric splitting; namely, if there exist toric ideals $I_{A_1}, I_{A_2}$ such that $I_A=I_{A_1}+I_{A_2}$ and $I_{A_i}\not =I_{A}$ for all $1 \leq i \leq 2$. We provide a necessary and…

Commutative Algebra · Mathematics 2024-10-25 Anargyros Katsabekis , Apostolos Thoma

We classify the countable linear orders $X$ for which there is an order $A$ with at least two points such that the lexicographic product $AX$ is isomorphic to $X$. Given such an $X$, we determine every corresponding order $A$, and identify…

Logic · Mathematics 2023-09-26 Garrett Ervin , Ethan Gu

Graph partitioning, or the dividing of a graph into two or more parts based on certain conditions, arises naturally throughout discrete mathematics, and problems of this kind have been studied extensively. In the 1990s, Ando conjectured…

Combinatorics · Mathematics 2021-08-27 Shagnik Das , Alexey Pokrovskiy , Benny Sudakov

For a given set of intervals on the real line, we consider the problem of ordering the intervals with the goal of minimizing an objective function that depends on the exposed interval pieces (that is, the pieces that are not covered by…

Data Structures and Algorithms · Computer Science 2011-12-05 Christoph Dürr , Maurice Queyranne , Frits C. R. Spieksma , Fabrice Talla Nobibon , Gerhard J. Woeginger

A cover of a finite group $G$ is a family of proper subgroups of $G$ whose union is $G$, and a cover is called minimal if it is a cover of minimal cardinality. A partition of $G$ is a cover such that the intersection of any two of its…

Group Theory · Mathematics 2019-04-10 Martino Garonzi , Michell Lucena Dias

Let $X$ be a separable nonquasireflexive Banach space. Let $Y$ be a Banach space isomorphic to a subspace of $X^*$. The paper is devoted to the following questions: 1. Under what conditions does there exist an isomorphic embedding $T:Y\to…

Functional Analysis · Mathematics 2010-09-07 Mikhail I. Ostrovskii

We arrange classical small cancellation constructions to produce left-orderable groups: we show that every finitely generated group is the quotient of a left-ordered small cancellation group by a finitely generated kernel (Rips…

Group Theory · Mathematics 2024-01-30 Markus Steenbock

We give a classification and complete algebraic description of groups allowing only finitely many (left multiplication invariant) circular orders. In particular, they are all solvable groups with a specific semi-direct product…

Group Theory · Mathematics 2017-04-21 Adam Clay , Kathryn Mann , Cristóbal Rivas

We show that a standard conic bundle over a minimal rational surface is rational and its Jacobian splits as the direct sum of Jacobians of curves if and only if its derived category admits a semiorthogonal decomposition by exceptional…

Algebraic Geometry · Mathematics 2012-12-12 Marcello Bernardara , Michele Bolognesi

We show how the separability problem is dual to that of decomposing any given matrix into a conic combination of rank-one partial isometries, thus offering a duality approach different to the positive maps characterization problem. Several…

Quantum Physics · Physics 2007-05-23 D. Salgado , J. L. Sanchez-Gomez , M. Ferrero

In this paper we will study the representations of isomorphisms between bases of topological spaces. It turns out that the perfect setting for this study is that of regular open subsets of complete metric spaces, but we have achieved some…

General Topology · Mathematics 2021-08-31 Javier Cabello Sánchez

A linear ordering is called context-free if it is the lexicographic ordering of some context-free language and is called scattered if it has no dense subordering. Each scattered ordering has an associated ordinal, called its rank. It is…

Formal Languages and Automata Theory · Computer Science 2019-07-29 Kitti Gelle , Szabolcs Ivan