English
Related papers

Related papers: Polyboxes, cube tilings and rigidity

200 papers

Let A, B, C, D be given finite sets of pairs of n-by-n complex matrices. We describe an algorithm to determine, with finitely many computations, whether there is a single unitary matrix U such that each pair of matrices in A is unitarily…

Representation Theory · Mathematics 2014-03-12 Tatiana G. Gerasimova , Roger A. Horn , Vladimir V. Sergeichuk

If g is a quasitriangular Lie bialgebra, one can asks what is the geometrical meaning of its r-matrix. A first answer was given in a paper by Weinstein and Xu, using purely geometrical means: roughly, one has that the formal Poisson group…

Quantum Algebra · Mathematics 2009-11-07 Fabio Gavarini , Gilles Halbout

Let $P$ be a (non necessarily convex) embedded polyhedron in $\R^3$, with its vertices on an ellipsoid. Suppose that the interior of $P$ can be decomposed into convex polytopes without adding any vertex. Then $P$ is infinitesimally rigid.…

Differential Geometry · Mathematics 2007-05-23 Jean-Marc Schlenker

In intuitive physics the process of stacking cubes has become a paradigmatic, canonical task. Even though it gets employed in various shades and complexities, the very fundamental setting with two cubes has not been thoroughly investigated.…

Human-Computer Interaction · Computer Science 2025-09-05 Nikolai Bahr , Christoph Zetzsche

In this paper, we investigate the mixed-integer nonlinear set with box constraints $X = \{(w,x)\in R\times Z^n:w\leq f(a^Tx),0\leq x\leq \mu\}$, where $f$ is a univariate concave function, $a\in R^n$, and $\mu\in Z^n_{++}$. This set arises…

Optimization and Control · Mathematics 2026-01-27 Keyan Li , Yan-Ru Wang , Wei-Kun Chen , Yu-Hong Dai

Fourier matrices naturally appear in many applications and their stability is closely tied to performance guarantees of algorithms. The starting point of this article is a result that characterizes properties of an exponential system on a…

Classical Analysis and ODEs · Mathematics 2025-09-30 Oleg Asipchuk , Laura De Carli , Weilin Li

Semiclassical systems being symmetric under Lie group are studied. A state of a semiclassical system may be viewed as a set (X,f) of a classical state X and a quantum state f in the external classical background X. Therefore, the set of all…

Mathematical Physics · Physics 2007-05-23 Oleg Shvedov

Let $T$ be a tile in $\mathbb{Z}^n$, meaning a finite subset of $\mathbb{Z}^n$. It may or may not tile $\mathbb{Z}^n$, in the sense of $\mathbb{Z}^n$ having a partition into copies of $T$. However, we prove that $T$ does tile $\mathbb{Z}^d$…

Combinatorics · Mathematics 2016-08-23 Vytautas Gruslys , Imre Leader , Ta Sheng Tan

We prove that fairly general spaces of tilings of R^d are fiber bundles over the torus T^d, with totally disconnected fiber. This was conjectured (in a weaker form) in [W3], and proved in certain cases. In fact, we show that each such space…

Dynamical Systems · Mathematics 2018-07-11 Lorenzo Sadun , R. F. Williams

We show that, for every set of $n$ points in the $d$-dimensional unit cube, there is an empty axis-parallel box of volume at least $\Omega(d/n)$ as $n\to\infty$ and $d$ is fixed. In the opposite direction, we give a construction without an…

Combinatorics · Mathematics 2021-02-26 Boris Bukh , Ting-Wei Chao

We investigate separability and entanglement of mixed states in ${\cal C}^2\otimes{\cal C}^2\otimes{\cal C}^N$ three party quantum systems. We show that all states with positive partial transposes that have rank $\le N$ are separable. For…

Quantum Physics · Physics 2009-11-07 S. Karnas , M. Lewenstein

The conditions determining that two triangles are congruent play a basic role in planimetry. By comparing not congruent triangles with respect to given sets of corresponding elements it is important to discover if they have any common…

History and Overview · Mathematics 2015-12-18 Vesselka Mihova , Julia Ninova

We consider the problem of characterizing isomorphisms of types, or, equivalently, constructive cardinality of sets, in the simultaneous presence of disjoint unions, Cartesian products, and exponentials. Mostly relying on results about…

Logic in Computer Science · Computer Science 2014-11-04 Danko Ilik

We study the simultaneous embeddability of a pair of partitions of the same underlying set into disjoint blocks. Each element of the set is mapped to a point in the plane and each block of either of the two partitions is mapped to a region…

Computational Geometry · Computer Science 2014-08-27 Jan Christoph Athenstädt , Tanja Hartmann , Martin Nöllenburg

This article is concerned with perfect isometries between blocks of finite groups. Generalizing a method of Enguehard to show that any two p-blocks of (possibly different) symmetric groups with the same weight are perfectly isometric, we…

Representation Theory · Mathematics 2015-12-01 Olivier Brunat , Jean-Baptiste Gramain

A (bar-and-joint) framework is a set of points in a normed space with a set of fixed distance constraints between them. Determining whether a framework is locally rigid - i.e. whether every other suitably close framework with the same…

Metric Geometry · Mathematics 2024-01-18 Sean Dewar

In this paper we initiate the study of racks from the combined perspective of combinatorics and finite group theory. A rack R is a set with a self-distributive binary operation. We study the combinatorics of the partially ordered set {\cal…

Combinatorics · Mathematics 2015-12-07 Istvan Heckenberger , John Shareshian , Volkmar Welker

We consolidate two widely believed conjectures about tautologies -- no optimal proof system exists, and most require superpolynomial size proofs in any system -- into a $p$-isomorphism-invariant condition satisfied by all paddable…

Computational Complexity · Computer Science 2022-07-21 Hunter Monroe

We prove that an element $g$ of prime order $>3$ belongs to the solvable radical $R(G)$ of a finite (or, more generally, a linear) group if and only if for every $x\in G$ the subgroup generated by $g, xgx^{-1}$ is solvable. This theorem…

Group Theory · Mathematics 2009-03-27 Nikolai Gordeev , Fritz Grunewald , Boris Kunyavskii , Eugene Plotkin

Two planar sets are circularly separable if there exists a circle enclosing one of the sets and whose open interior disk does not intersect the other set. This paper studies two problems related to circular separability. A linear-time…

Computational Geometry · Computer Science 2016-08-31 Jean-Daniel Boissonnat , Jurek Czyzowicz , Olivier Devillers , Mariette Yvinec