English
Related papers

Related papers: Polyboxes, cube tilings and rigidity

200 papers

We take the first steps towards a better understanding of continuous orbit equivalence, i.e., topological orbit equivalence with continuous cocycles. First, we characterise continuous orbit equivalence in terms of isomorphisms of C*-crossed…

Dynamical Systems · Mathematics 2015-03-06 Xin Li

In quantum systems, entanglement corresponds to nonclassical correlation of nonlocal observables. Thus, entanglement (or, to the contrary, separability) of a given quantum state is not uniquely determined by properties of the state, but may…

Quantum Physics · Physics 2012-05-21 Iacopo Pozzana

Let $H$ be a Krull monoid with finite class group $G$ such that every class contains a prime divisor. We consider the system $\mathcal L (H)$ of all sets of lengths of $H$ and study when $\mathcal L (H)$ contains or is contained in a system…

Commutative Algebra · Mathematics 2020-11-30 Alfred Geroldinger , Wolfgang Schmid

Regular triangulations of products of lattice polytopes are constructed with the additional property that the dual graphs of the triangulations are bipartite. The (weighted) size difference of this bipartition is a lower bound for the…

Combinatorics · Mathematics 2007-05-23 Michael Joswig , Nikolaus Witte

With any state of a multipartite quantum system its separability polytope is associated. This is an algebro-topological object (non-trivial only for mixed states) which captures the localisation of entanglement of the state. Particular…

Quantum Physics · Physics 2015-06-26 Roman R. Zapatrin

We present structures comprised of identical convex polyhedra which are interlocked geometrically. These sets cannot be disassembled by removing individual polyhedra by translations and/or rotations. The shapes that permit interlocking…

Metric Geometry · Mathematics 2017-12-05 A. J. Kanel-Belov , A. V. Dyskin , Y. Estrin , E. Pasternak , I. A. Ivanov-Pogodaev

A graph $G$ is a brick if it is 3-connected and $G-\{u,v\}$ has a perfect matching for any two distinct vertices $u$ and $v$ of $G$. A brick $G$ is solid if for any two vertex disjoint odd cycles $C_1$ and $C_2$ of $G$, $G-(V(C_1)\cup…

Combinatorics · Mathematics 2025-07-30 Yipei Zhang , Xiumei Wang

A set $A$ is dually Dedekind finite if every surjection from $A$ onto $A$ is injective; otherwise, $A$ is dually Dedekind infinite. An amorphous set is an infinite set that cannot be partitioned into two infinite subsets. A strictly…

Logic · Mathematics 2025-10-16 Yifan Hu , Ruihuan Mao , Guozhen Shen

Suppose $f\in L^1(\mathbb{R}^d)$, $\Lambda\subset\mathbb{R}^d$ is a finite union of translated lattices such that $f+\Lambda$ tiles with a weight. We prove that there exists a lattice $L\subset{\mathbb{R}}^d$ such that $f+L$ also tiles,…

Combinatorics · Mathematics 2019-10-23 Bochen Liu

Main topic of the paper is the determination, for a compact complex manifold $M$, of the class of manifolds $X$ which are deformation equivalent to it. If $M$ is a complex torus, then also $X$ is so. After describing the structure of…

Algebraic Geometry · Mathematics 2007-05-23 Fabrizio Catanese

In this paper we study the problem of deciding whether two disjoint semialgebraic sets of an algebraic variety over R are separable by a polynomial. For that we isolate a dense subfamily of Spaces of Orderings, named Geometric, which…

alg-geom · Mathematics 2008-02-03 F. Acquistapace , C. Andradas , F. Broglia

Let $G$ be a classical algebraic group, $X$ a maximal rank reductive subgroup and $P$ a parabolic subgroup. This paper classifies when $X\G/P$ is finite. Finiteness is proven using geometric arguments about the action of $X$ on subspaces of…

Group Theory · Mathematics 2007-05-23 W. Ethan Duckworth

We study relationships between various set theoretic compactness principles, focusing on the interplay between the three families of combinatorial objects or principles mentioned in the title. Specifically, we show the following. (1) Strong…

Logic · Mathematics 2024-01-30 Chris Lambie-Hanson , Assaf Rinot , Jing Zhang

Let $\G$ denote a bipartite distance-regular graph with vertex set $X$ and diameter $D \ge 3$. Fix $x \in X$ and let $L$ (resp. $R$) denote the corresponding lowering (resp. raising) matrix. We show that each $Q$-polynomial structure for…

Combinatorics · Mathematics 2011-08-12 Stefko Miklavic , Paul Terwilliger

Trinomial varieties are affine varieties given by some special system of equations consisting of polynomials with three terms. Such varieties are total coordinate spaces of normal rational varieties with torus action of complexity one. For…

Algebraic Geometry · Mathematics 2019-07-16 Sergey Gaifullin

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 two-dimensional conformal field theory, we analyze conformally invariant boundary conditions which break part of the bulk symmetries. When the subalgebra that is preserved by the boundary conditions is the fixed algebra under the action…

High Energy Physics - Theory · Physics 2009-10-31 J. Fuchs , C. Schweigert

There exist several simple representations of uncertainty that are easier to handle than more general ones. Among them are random sets, possibility distributions, probability intervals, and more recently Ferson's p-boxes and Neumaier's…

Probability · Mathematics 2008-08-21 Sebastien Destercke , Didier Dubois , Eric Chojnacki

The mixedness of one share of a pure bipartite state determines whether the overall state is a separable, unentangled state. Here we consider quantum computational tests of mixedness, and we derive an exact expression of the acceptance…

Quantum Physics · Physics 2024-07-16 Zachary P. Bradshaw , Margarite L. LaBorde , Mark M. Wilde

The lifted multicut problem is a combinatorial optimization problem whose feasible solutions relate one-to-one to the decompositions of a graph $G = (V, E)$. Given an augmentation $\widehat{G} = (V, E \cup F)$ of $G$ and given costs $c \in…

Discrete Mathematics · Computer Science 2024-04-15 Lucas Fabian Naumann , Jannik Irmai , Shengxian Zhao , Bjoern Andres