We prove a result which adds to the study of continuous analogues of Szemerédi-type problems. Let E ⊆ ℝⁿ be a Lebesgue-null set of Hausdorff dimension α, k, m be integers satisfying a suitable relationship, and {B₁,…, Bk} be n × (m − n) matrices. We prove that if the set of matrices Bi are non-degenerate in a particular sense, α is sufficiently close to n, and if E supports a probability measure satisfying certain dimensionality and Fourier decay conditions, then E contains a k-point configuration of the form {x + B₁y,…,x + Bky}. In particular, geometric configurations such as collinear triples, triangles, and parallelograms are contained in sets satisfying the above conditions.Science, Faculty ofMathematics, Department ofGraduat
We present structural results on solutions to the Diophantine system $A{\boldsymbol y} = {\...
We identify and solve an overlooked problem about the characterization of underdeter-mined systems o...
The problem of recovering a sparse vector via an underdetermined system of linear equations using a ...
We prove a result which adds to the study of continuous analogues of Szemerédi-type problems. Let E ...
Abstract. In a recent paper, Chan, Laba, and Pramanik investigated geometric configurations inside ...
Let Φ∈Rm×n be a sparse Johnson–Lindenstrauss transform (Kane and Nelson in J ACM 61(1):4, 2014) with...
We look into the rich combinatorics of fully-packed loop configurations (or FPL, or alternating-sign...
We give a new theoretical tool to solve sparse systems with finitely many solutions. It is based on ...
We present structural results on solutions to the Diophantine system Ay = b, y ∈ Z t ≥0 with the ...
AbstractIn the factorization A = QR of a sparse matrix A, the orthogonal matrix Q can be represented...
Abstract. Using a slight modification of an argument of Croot, Ruzsa and Schoen we establish a quant...
A common theme in modern combinatorics consists in proving sparse analogues of results known in the ...
Une matrice aléatoire n x n est diluée lorsque le nombre d'entrées non nulles est d'ordre n ; les ma...
The sparse null space basis problem is the following: $A t \times n$ matrix $A (t less than n)$ is ...
ℓ_1 minimization is often used for recovering sparse signals from an under-determined linear system...
We present structural results on solutions to the Diophantine system $A{\boldsymbol y} = {\...
We identify and solve an overlooked problem about the characterization of underdeter-mined systems o...
The problem of recovering a sparse vector via an underdetermined system of linear equations using a ...
We prove a result which adds to the study of continuous analogues of Szemerédi-type problems. Let E ...
Abstract. In a recent paper, Chan, Laba, and Pramanik investigated geometric configurations inside ...
Let Φ∈Rm×n be a sparse Johnson–Lindenstrauss transform (Kane and Nelson in J ACM 61(1):4, 2014) with...
We look into the rich combinatorics of fully-packed loop configurations (or FPL, or alternating-sign...
We give a new theoretical tool to solve sparse systems with finitely many solutions. It is based on ...
We present structural results on solutions to the Diophantine system Ay = b, y ∈ Z t ≥0 with the ...
AbstractIn the factorization A = QR of a sparse matrix A, the orthogonal matrix Q can be represented...
Abstract. Using a slight modification of an argument of Croot, Ruzsa and Schoen we establish a quant...
A common theme in modern combinatorics consists in proving sparse analogues of results known in the ...
Une matrice aléatoire n x n est diluée lorsque le nombre d'entrées non nulles est d'ordre n ; les ma...
The sparse null space basis problem is the following: $A t \times n$ matrix $A (t less than n)$ is ...
ℓ_1 minimization is often used for recovering sparse signals from an under-determined linear system...
We present structural results on solutions to the Diophantine system $A{\boldsymbol y} = {\...
We identify and solve an overlooked problem about the characterization of underdeter-mined systems o...
The problem of recovering a sparse vector via an underdetermined system of linear equations using a ...