English
Related papers

Related papers: Open sets satisfying systems of congruences

200 papers

We initiate a systematic study of the computational complexity of the Constraint Satisfaction Problem (CSP) over finite structures that may contain both relations and operations. We show the close connection between this problem and a…

Logic in Computer Science · Computer Science 2021-12-02 Libor Barto , William DeMeo , Antoine Mottet

Mermin and Peres showed that there are boolean constraint systems (BCSs) which are not satisfiable, but which are satisfiable with quantum observables. This has led to a burgeoning theory of quantum satisfiability for constraint systems,…

Quantum Physics · Physics 2025-01-16 Connor Paddock , William Slofstra

We collect here various conjectures on congruences made by the author in a series of papers, some of which involve binary quadratic forms and other advanced theories. Part A consists of 100 unsolved conjectures of the author while…

Number Theory · Mathematics 2015-03-13 Zhi-Wei Sun

The Constraint Satisfaction Problem (CSP) has been intensively studied in many areas of computer science and mathematics. The approach to the CSP based on tools from universal algebra turned out to be the most successful one to study the…

Logic · Mathematics 2025-01-16 Andrei A. Bulatov

We completely describe in terms of Hausdorff measures the size of the set of points of the circle that are covered infinitely often by a sequence of random arcs with given lengths. We also show that this set is a set with large…

Probability · Mathematics 2008-06-06 Arnaud Durand

A classical result of A.D. Alexandrov states that a connected compact smooth $n-$dimensional manifold without boundary, embedded in $\Bbb R^{n+1}$, and such that its mean curvature is constant, is a sphere. Here we study the problem of…

Analysis of PDEs · Mathematics 2007-05-23 YanYan Li , Louis Nirenberg

We asymptotically estimate the variance of the number of lattice points in a thin, randomly rotated annulus lying on the surface of the sphere. This partially resolves a conjecture of Bourgain, Rudnick, and Sarnak. We also obtain estimates…

Number Theory · Mathematics 2022-07-25 Peter Humphries , Maksym Radziwiłł

The class of convex sets that admit approximations as Minkowski sum of a compact convex set and a closed convex cone in the Hausdorff distance is introduced. These sets are called approximately Motzkin-decomposable and generalize the notion…

Optimization and Control · Mathematics 2024-01-25 Daniel Dörfler , Andreas Löhne

We consider uncountable almost disjoint families of subsets of $\mathbb N$, the Johnson-Lindenstrauss Banach spaces $(\mathcal X_{\mathcal A}, \|\ \|_\infty)$ induced by them, and their natural equivalent renormings $(\mathcal X_{\mathcal…

Functional Analysis · Mathematics 2022-12-13 Osvaldo Guzmán , Michael Hrušák , Piotr Koszmider

High proved the following theorem. If the intersections of any two congruent copies of a plane convex body are centrally symmetric, then this body is a circle. In our paper we extend the theorem of High to spherical and hyperbolic planes.…

Metric Geometry · Mathematics 2016-01-19 J. Jerónimo-Castro , E. Makai

The following problem was proposed in 2010 by S. Lando. Let $M$ and $N$ be two unions of the same number of disjoint circles in a sphere. Do there always exist two spheres in 3-space such that their intersection is transversal and is a…

Geometric Topology · Mathematics 2014-11-27 Sergey Avvakumov

It is well known that axiom of choice implies the existence of non-measurable sets for Lebesgue's measure on R as well as the existence of "paradoxical" decompositions of the unit ball of R^3 (Banach-Tarski). This is generally interpreted…

General Topology · Mathematics 2013-03-25 Olivier Leroy

Let $G$ be a u.s.c decomposition of $S^n$, $H_G$ denote the set of nondegenerate elements and $\pi$ be the projection of $S^n$ onto $S^n/G$. Suppose that each point in the decomposition space has arbitrarily small neighborhoods with…

Geometric Topology · Mathematics 2014-06-04 Shijie Gu

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

Spherical manifolds yield cosmic spaces with positive curvature. They result by closing pieces from the sphere used by Einstein for his initial cosmology. Harmonic analysis on the manifolds aims at explaining the observed low amplitudes at…

Cosmology and Nongalactic Astrophysics · Physics 2010-11-19 Peter Kramer

High proved the following theorem. If the intersections of any two congruent copies of a plane convex body are centrally symmetric, then this body is a circle. In our paper we extend the theorem of High to the sphere and the hyperbolic…

Metric Geometry · Mathematics 2024-07-19 J. Jerónimo-Castro , E. Makai

We prove several reflection theorems on $D$-spaces, which are Hausdorff topological spaces $X$ in which for every open neighbourhood assignment $U$ there is a closed discrete subspace $D$ such that \[ \bigcup\{U(x): x\in D\}=X. \] The…

Logic · Mathematics 2008-11-10 Mirna Dzamonja

We prove several reflection theorems on $D$-spaces, which are Hausdorff topological spaces $X$ in which for every open neighbourhood assignment $U$ there is a closed discrete subspace $D$ such that \[ \bigcup\{U(x): x\in D\}=X. \] The…

Logic · Mathematics 2007-05-23 Mirna Džamonja

We investigate the problem of defining group or loop structures on spheres, where by ''sphere'' we mean the level set q(x) = c of a general K-valued quadratic form q, for an invertible scalar c. When K is a field and q non-degenerate, then…

Group Theory · Mathematics 2024-10-24 Wolfgang Bertram

We consider the problem of satisfiability of sets of constraints in a given set of finite uniform hypergraphs. While the problem under consideration is similar in nature to the problem of satisfiability of constraints in graphs, the…

Logic in Computer Science · Computer Science 2025-08-25 Antoine Mottet , Tomáš Nagy , Michael Pinsker