English
Related papers

Related papers: Polyboxes, cube tilings and rigidity

200 papers

Let K be a self-similar or self-affine set in R^d, let \mu be a self-similar or self-affine measure on it, and let G be the group of affine maps, similitudes, isometries or translations of R^d. Under various assumptions (such as separation…

General Mathematics · Mathematics 2008-07-14 Márton Elekes , Tamás Keleti , András Máthé

Let $\F$ be a finite family of axis-parallel boxes in $\R^d$ such that $\F$ contains no $k+1$ pairwise disjoint boxes. We prove that if $\F$ contains a subfamily $\M$ of $k$ pairwise disjoint boxes with the property that for every $F\in \F$…

Combinatorics · Mathematics 2017-08-01 Maria Chudnovsky , Sophie Spirkl , Shira Zerbib

Let $G=(V,E)$ be a matching-covered graph and $X$ be an edge set of $G$. $X$ is said to be feasible if there exist two perfect matchings $M_1$ and $M_2$ in $G$ such that $|M_1\cap X|\not \equiv|M_2\cap X|\ (\mbox{mod } 2)$. For any…

Combinatorics · Mathematics 2020-08-18 Xiao Zhao , Fengming Dong , Sheng Chen

We give a general description of the structure of a discrete double groupoid (with an extra, quite natural, filling condition) in terms of groupoid factorizations and groupoid 2-cocycles with coefficients in abelian group bundles. Our…

Category Theory · Mathematics 2010-06-29 Nicolás Andruskiewitsch , Sonia Natale

Let $G$ be a connected semi-simple algebraic group of adjoint type over an algebraically closed field, and let $\overline{G}$ be the wonderful compactification of $G$. For a fixed pair $(B, B^-)$ of opposite Borel subgroups of $G$, we look…

Representation Theory · Mathematics 2009-07-08 Xuhua He , Jiang-Hua Lu

We show that if A is a large subset of a box in Z^d with dimensions L_1 >= L_2 >= ... >= L_d which are all reasonably large, then |A + A| > 2^{d/48}|A|. By combining this with Chang's quantitative version of Freiman's theorem, we prove a…

Number Theory · Mathematics 2007-05-23 Ben Green

We introduce a new equivalence relation on the set of all polygonal billiards. We say that two billiards (or polygons) are order equivalent if each of the billiards has an orbit whose footpoints are dense in the boundary and the two…

Dynamical Systems · Mathematics 2012-01-19 Jozef Bobok , Serge Troubetzkoy

Give deterministic necessary and sufficient conditions to guarantee that if a subspace fits certain partially observed data from a union of subspaces, it is because such data really lies in a subspace. Furthermore, Give deterministic…

Machine Learning · Statistics 2014-08-28 Daniel L. Pimentel-Alarcón

We prove that the set of large values of the trigonometric polynomial over a subset of density of the primes has some additive structure, similarly to what happens for subsets of densities in $\mathbb{Z}/{N}\mathbb{Z}$ but in a weaker form.…

Number Theory · Mathematics 2025-01-10 Olivier Ramaré

Nonlinear perturbation of Fuchsian systems are studied in a region including two singularities. It is proved that such systems are generally not analytically equivalent to their linear part (they are not linearizable) and the obstructions…

Classical Analysis and ODEs · Mathematics 2009-11-13 Rodica D. Costin

We introduce algebraic sets in the complex projective spaces for the mixed states in bipartite quantum systems as their invariants under local unitary operations. The algebraic sets of the mixed state have to be the union of the linear…

Quantum Physics · Physics 2007-05-23 Hao Chen

Let X be a compact connected Riemann surface equipped with an anti-holomorphic involution \sigma. Let G be a connected complex reductive affine algebraic group, and let \sigma_G be a real form of G. We consider holomorphic principal…

Algebraic Geometry · Mathematics 2012-09-26 Indranil Biswas , Jacques Hurtubise

A simple convex polytope $P$ is \emph{cohomologically rigid} if its combinatorial structure is determined by the cohomology ring of a quasitoric manifold over $P$. Not every $P$ has this property, but some important polytopes such as…

Algebraic Topology · Mathematics 2014-02-26 Suyoung Choi , Taras Panov , Dong Youp Suh

We consider partially ordered sets of combinatorial structures under consecutive orders, meaning that two structures are related when one embeds in the other such that `consecutive' elements remain consecutive in the image. Given such a…

Combinatorics · Mathematics 2026-04-22 Victoria Ironmonger , Nik Ruškuc

The robustness properties of bipartite entanglement in systems of N bosons distributed in M different modes are analyzed using a definition of separability based on commuting algebras of observables, a natural choice when dealing with…

Quantum Physics · Physics 2012-05-09 F. Benatti , R. Floreanini , U. Marzolino

Whenever a mathematical proposition to be proved requires more information than it is contained in an axiomatic system, it can neither be proved nor disproved, i.e. it is undecidable, or logically undetermined, within this axiomatic system.…

Quantum Physics · Physics 2009-12-06 Caslav Brukner

Consider a group G and a family $\mathcal{A}$ of subgroups of G. We say that vertex finiteness holds for splittings of G over $\mathcal{A}$ if, up to isomorphism, there are only finitely many possibilities for vertex stabilizers of minimal…

Group Theory · Mathematics 2019-06-07 Vincent Guirardel , Gilbert Levitt

A simplicial polytope is combinatorially rigid if its combinatorial structure is determined by its graded Betti numbers which are important invariant coming from combinatorial commutative algebra. We find a necessary condition to be…

Combinatorics · Mathematics 2011-08-30 Suyoung Choi , Jang Soo Kim

Super-stability and strong stability are properties of a matching in the stable matching problem with ties. In this paper, we introduce a common generalization of super-stability and strong stability, which we call non-uniform stability.…

Computer Science and Game Theory · Computer Science 2024-08-30 Naoyuki Kamiyama

Let k_1,...,k_d be positive integers, and D be a subset of [k_1]x...x[k_d], whose complement can be decomposed into disjoint sets of the form {x_1}x...x{x_{s-1}}x[k_s]x{x_{s+1}}x...x{x_d}. We conjecture that the number of elements of D can…

Combinatorics · Mathematics 2008-07-08 Andrzej P. Kisielewicz , Krzysztof Przesławski
‹ Prev 1 4 5 6 7 8 10 Next ›