English
Related papers

Related papers: On Dedekind's problem, a sparse version of Sperner…

200 papers

One of the cornerstones of the distributed complexity theory is the derandomization result by Chang, Kopelowitz, and Pettie [FOCS 2016]: any randomized LOCAL algorithm that solves a locally checkable labeling problem (LCL) can be…

Distributed, Parallel, and Cluster Computing · Computer Science 2023-05-16 Sameep Dahal , Francesco d'Amore , Henrik Lievonen , Timothé Picavet , Jukka Suomela

Let $\mathcal{P}$ be the set of all primes and $\psi(n)=n\prod_{n\in \mathcal{P},p|n}(1+1/p)$ be the Dedekind psi function. We show that the Riemann hypothesis is satisfied if and only if $f(n)=\psi(n)/n-e^{\gamma} \log \log n <0$ for all…

General Mathematics · Mathematics 2010-10-26 Michel Planat

Consider $S$, a set of $n$ points chosen uniformly at random and independently from the unit hypercube of dimension $t>2$. Order $S$ by using the Cartesian product of the $t$ standard orders of $[0,1]$. We determine a constant $\bar x(t)<e$…

Combinatorics · Mathematics 2025-07-15 Boris Pittel

The works on decoherence due to spin baths usually agree in studying a one-spin system in interaction with a large spin bath. In this paper we generalize those models by analyzing a many-spin system and by studying decoherence or its…

Quantum Physics · Physics 2010-01-21 Mario Castagnino , Sebastian Fortin , Olimpia Lombardi

We study maximum antichains in two posets related to quiver representations. Firstly, we consider the set of isomorphism classes of indecomposable representations ordered by inclusion. For various orientations of the Dynkin diagram of type…

Representation Theory · Mathematics 2016-08-12 Florian Gellert , Philipp Lampe

We consider quantum superposition states in Bose-Einstein condensates. A decoherence rate for the Schr\"odinger cat is calculated and shown to be a significant threat to this macroscopic quantum superposition of BEC's. An experimental…

Condensed Matter · Physics 2007-05-23 Diego A. R. Dalvit , Jacek Dziarmaga , Wojciech H. Zurek

We present a polynomial-time quantum algorithm for the Hidden Subgroup Problem over $\mathbb{D}_{2^n}$. The usual approach to the Hidden Subgroup Problem relies on harmonic analysis in the domain of the problem, and the best known algorithm…

Quantum Physics · Physics 2022-02-24 Matthew Moore , Grace Young

In this paper, we consider the Cauchy problem of semi-linear degenerate backward stochastic partial differential equations (BSPDEs in short) under general settings without technical assumptions on the coefficients. For the solution of…

Probability · Mathematics 2011-09-06 Kai Du , Qi Zhang

The baryonic decays of $J/ \psi$ provide a new way to study the internal structure of baryons. We apply a simple diquark model to the calculation of the decay cross-sections for the reactions $J/ \psi \longrightarrow \bar{p}p$, $\bar…

High Energy Physics - Phenomenology · Physics 2009-11-10 A. Cieply , B. S. Zou

We consider a potential scattering of Bose-Hubbard dimer in 1D optical lattice. A numerical approach based on effective non-Hermitian Hamiltonian has been developed for solving the scattering problem. It allows to compute the tunneling and…

Quantum Physics · Physics 2014-09-15 Dmitrii N. Maksimov , Andrey R. Kolovsky

Regard the closed interval $[0,1]$ as a stick. Partition $[0,1]$ into $n+1$ different intervals $I_1, \ \dots \ , I_{n+1},$ where $n \geq 2,$ which represent smaller sticks. The classical Broken Stick problem asks to find the probability…

Probability · Mathematics 2021-12-14 Vivek Kaushik

We show that the maximum cardinality of an anti-chain composed of intersections of a given set of n points in the plane with half-planes is close to quadratic in n. We approach this problem by establishing the equivalence with the problem…

Metric Geometry · Mathematics 2015-02-18 Rom Pinchasi , Günter Rote

In 1933, Karol Borsuk asked whether each bounded set in the $n$-dimensional Euclidean space can be divided into $n$+1 parts of smaller diameter. Because it would not make sense otherwise, one usually assumes that he just forgot to require…

Combinatorics · Mathematics 2025-03-14 Thomas Jenrich

The de Bruijn torus (or grid) problem looks to find an $n$-by-$m$ binary matrix in which every possible $j$-by-$k$ submatrix appears exactly once. The existence and construction of these binary matrices was determined in the 70's, with…

Combinatorics · Mathematics 2015-11-24 Victoria Horan , Brett Stevens

We prove that any finite collection of polygons of equal area has a common hinged dissection. That is, for any such collection of polygons there exists a chain of polygons hinged at vertices that can be folded in the plane continuously…

Computational Geometry · Computer Science 2008-06-12 Timothy G. Abbott , Zachary Abel , David Charlton , Erik D. Demaine , Martin L. Demaine , Scott D. Kominers

We identify a general criterion for detecting entanglement of pure bipartite quantum states describing a system of two identical particles. Such a criterion is based both on the consideration of the Slater-Schmidt number of the fermionic…

Quantum Physics · Physics 2016-09-08 GianCarlo Ghirardi , Luca Marinatto

A celebrated result of Alon and F\"{u}redi gives a tight lower bound on the number of hyperplanes required to cover all points of the Boolean cube $B^n$ except the origin $\bm{0}$. Recent breakthroughs by Sauermann and Wigderson generalized…

Combinatorics · Mathematics 2026-04-21 Zihao Huang , Miao Wang , Suijie Wang

A class of backward doubly stochastic differential equations (BDSDEs in short) with continuous coefficients is studied. We give the comparison theorems, the existence of the maximal solution and the structure of solutions for BDSDEs with…

Probability · Mathematics 2010-06-08 Yufeng Shi , Qingfeng Zhu

A de Bruijn cycle is a cyclic listing of length A, of a collection of A combinatorial objects, so that each object appears exactly once as a set of consecutive elements in the cycle. In this paper, we show the power of de Bruijn's original…

Combinatorics · Mathematics 2013-04-11 Andre Campbell , Anant Godbole , Bill Kay

We solve a question of Gowers from 2009 on clique differences in chains, thus ruling out any Sperner-type proof of the polynomial density Hales-Jewett theorem for alphabets of size 2.

Combinatorics · Mathematics 2025-09-04 Ryan Alweiss