English
Related papers

Related papers: Independent sets in the discrete hypercube

200 papers

We study the set of visible lattice points in multidimensional hypercubes. The problems we investigate mix together geometric, probabilistic and number theoretic tones. For example, we prove that almost all self-visible triangles with…

Number Theory · Mathematics 2022-04-08 Jayadev S. Athreya , Cristian Cobeli , Alexandru Zaharescu

In this paper we continue the study of critical sets of solutions $u_\e$ of second-order elliptic equations in divergence form with rapidly oscillating and periodic coefficients. In \cite{Lin-Shen-3d}, by controling the "turning" of…

Analysis of PDEs · Mathematics 2022-04-07 Fanghua Lin , Zhongwei Shen

We consider discrete nonlinear hyperbolic equations on quad-graphs, in particular on the square lattice. The fields are associated to the vertices and an equation Q(x_1,x_2,x_3,x_4)=0 relates four fields at one quad. Integrability of…

Exactly Solvable and Integrable Systems · Physics 2009-06-12 Vsevolod E. Adler , Alexander I. Bobenko , Yuri B. Suris

We study the set of $D$ such that a given irreducible hypersurface $C$ of degree $d$ has infinitely many points of degree $D$ over $\mathbb{Q}$. We give a new explicit proof that this set contains all (positive) multiples of the index of…

Number Theory · Mathematics 2025-10-21 Lea Beneish , Andrew Granville

We show that the d-cube is determined by the spectrum of its distance matrix.

Combinatorics · Mathematics 2016-04-29 Jack. H. Koolen , Sakander Hayat , Quaid Iqbal

Independent sets in graphs are sets of vertices containing no neighbors, and they represent a canonical spin system with hardcore constraints. Of particular interest is the setting of the boolean hypercube, where counting independent sets…

Probability · Mathematics 2025-11-11 Mriganka Basu Roy Chowdhury , Shirshendu Ganguly , Vilas Winstein

It is known that there are finitely many simplicial complexes (up to isomorphism) with a given number of vertices. Translating to the language of $h$-vectors, there are finitely many simplicial complexes of bounded dimension with $h_1=k$…

Combinatorics · Mathematics 2020-09-29 Federico Castillo , Jose Alejandro Samper

We study 2D discrete integrable equations of order 1 with respect to one independent variable and $m$ with respect to another one. A generalization of the multidimensional consistency property is proposed for this type of equations. The…

Exactly Solvable and Integrable Systems · Physics 2014-08-27 V. E. Adler , V. V. Postnikov

We present a simple construction of an acute set of size $2^{d-1}+1$ in $\mathbb{R}^d$ for any dimension $d$. That is, we explicitly give $2^{d-1}+1$ points in the $d$-dimensional Euclidean space with the property that any three points form…

Metric Geometry · Mathematics 2017-09-22 Balázs Gerencsér , Viktor Harangi

For a finite point set $P \subset \mathbb{R}^d$, denote by $\text{diam}(P)$ the ratio of the largest to the smallest distances between pairs of points in $P$. Let $c_{d, \alpha}(n)$ be the largest integer $c$ such that any $n$-point set $P…

Combinatorics · Mathematics 2025-01-30 Boris Bukh , Zichao Dong

We study the space $C(a_0,a_1,\dots,a_n)$ of hyperbolic 2-spheres with cone points of prescribed apex curvatures $2a_0,2a_1,\dots,2a_n\in]0,2\pi[$ and some related spaces. For $n=3$, we get a detailed description of such spaces. The…

Geometric Topology · Mathematics 2020-03-27 Sasha Anan'in , Carlos H. Grossi , Jaejeong Lee , João dos Reis

The proportion of $d$-element subsets of $\mathbb{F}_2^d$ that are bases is asymptotic to $\prod_{j=1}^{\infty}(1-2^{-j}) \approx 0.29$ as $d \to \infty$. It is natural to ask whether there exists a (large) subset $\mathcal{F}$ of…

Combinatorics · Mathematics 2025-03-03 David Ellis , Maria-Romina Ivan , Imre Leader

In this work we study the asymptotic distribution of eigenvalues in one-dimensional open sets. The method of proof is rather elementary, based on the Dirichlet lattice points problem, which enable us to consider sets with infinite measure.…

Analysis of PDEs · Mathematics 2009-06-15 J. Fernandez Bonder , J. P. Pinasco , A. M. Salort

We prove that infinite p-adically discrete sets have Diophantine definitions in large subrings of some number fields. First, if K is a totally real number field or a totally complex degree-2 extension of a totally real number field, then…

Number Theory · Mathematics 2017-04-03 Bjorn Poonen , Alexandra Shlapentokh

For any natural number $d$ and positive number $\varepsilon$, we present a point set in the $d$-dimensional unit cube $[0,1]^d$ that intersects every axis-aligned box of volume greater than $\varepsilon$. These point sets are very easy to…

Computational Geometry · Computer Science 2017-09-12 David Krieg

We obtain asymptotic upper bounds for the number of natural solutions of the following diagonal Diophantine equations in a hypercube with side - $N$ in the paper: $x_1 = x_2^k+...+x_s^k$, $x_1^k = x_2^k+...+x_s^k$, $x_1 = \sum_{j=2}^s…

Number Theory · Mathematics 2020-01-24 Victor Volfson

We study the asymptotics of the set $S(d)$ of possible prime orders of $K$-rational points on elliptic curves over number fields $K$ of degree $d$ as $d$ tends to infinity. Assuming some conjectures on the sparsity of newforms of weight $2$…

Number Theory · Mathematics 2025-05-21 Maarten Derickx , Michael Stoll

In this paper, we prove scattering asymptotics for the 2D (discrete dimension) cubic resonant system. This scattering result was used in Zhao \cite{Z1} as an assumption to obtain the scattering for cubic NLS on $\mathbb{R}^2\times…

Analysis of PDEs · Mathematics 2022-07-05 Kailong Yang , Zehua Zhao

Let $H$ and $K$ be subsets of the vertex set $V(Q_d)$ of the $d$-cube $Q_d$ (we call $H$ and $K$ configurations in $Q_d$). We say $K$ is an \emph{exact copy} of $H$ if there is an automorphism of $Q_d$ which sends $H$ to $K$. If $d$ is a…

Combinatorics · Mathematics 2020-09-22 John Goldwasser , Ryan Hansen

We study the algorithmic task of finding large independent sets in Erdos-Renyi $r$-uniform hypergraphs on $n$ vertices having average degree $d$. Krivelevich and Sudakov showed that the maximum independent set has density $\left(\frac{r\log…

Computational Complexity · Computer Science 2025-10-27 Abhishek Dhawan , Yuzhou Wang