Related papers: On scattered linear sets of pseudoregulus type in …
In $d$-Scattered Set we are given an (edge-weighted) graph and are asked to select at least $k$ vertices, so that the distance between any pair is at least $d$, thus generalizing Independent Set. We provide upper and lower bounds on the…
Supervised manifold learning methods learn data representations by preserving the geometric structure of data while enhancing the separation between data samples from different classes. In this work, we propose a theoretical study of…
Details are presented of an efficient formalism for calculating transmission and reflection matrices from first principles in layered materials. Within the framework of spin density functional theory and using tight-binding muffin-tin…
Pseudoline arrangements are fundamental objects in discrete and computational geometry, and different works have tackled the problem of improving the known bounds on the number of simple arrangements of $n$ pseudolines over the past…
Scattered neutron spectroscopy is a diagnostic technique commonly used to measure areal density in ICF experiments. Deleterious areal density asymmetries modify the shape of the scattered neutron spectrum. In this work a novel analysis is…
The goal of this work is to give new quantitative results about the distribution of semi-arithmetic hyperbolic surfaces in the moduli space of closed hyperbolic surfaces. We show that two coverings of genus $g$ of a fixed arithmetic surface…
We study the regularity and the algebraic properties of certain lattice ideals. We establish a map I --> I\~ between the family of graded lattice ideals in an N-graded polynomial ring over a field K and the family of graded lattice ideals…
We consider the problem Scattered Cycles which, given a graph $G$ and two positive integers $r$ and $\ell$, asks whether $G$ contains a collection of $r$ cycles that are pairwise at distance at least $\ell$. This problem generalizes the…
A fast and reliable algorithm for the optimal interpolation of scattered data on the torus by multivariate trigonometric polynomials is presented. The algorithm is based on a variant of the conjugate gradient method in combination with the…
Foundational Models pretrained on huge amount of data learn representations that evolve across depth, forming a hierarchy of embeddings with distinct semantic content and geometric structure. Contrary to the widespread practice of using…
Using numerical simulations, the stability and scattering properties of the O(3) model on a two-dimensional torus are studied. Its solitons are found to be unstable but can be stabilized by the addition of a Skyrme term to the Lagrangian.…
The presence of a scattering medium in the imaging path between an object and an observer is known to severely limit the visual acuity of the imaging system. We present an approach to circumvent the deleterious effects of scattering, by…
Let $L$ be a lattice of full rank in $n$-dimensional real space. A vector in $L$ is called $i$-sparse if it has no more than $i$ nonzero coordinates. We define the $i$-th successive sparsity level of $L$, $s_i(L)$, to be the minimal $s$ so…
A theoretical framework is developed for scattering of scalar radiation from stationary, three-dimensional media with correlation functions of scattering potentials obeying $\mathcal{PT}$-symmetry. It is illustrated that unlike in…
Dimensionality Reduction (DR) scatterplot layouts have become a ubiquitous visualization tool for analyzing multidimensional datasets. Despite their popularity, such scatterplots suffer from occlusion, especially when informative glyphs are…
The scattering transform is a multilayered, wavelet-based transform initially introduced as a model of convolutional neural networks (CNNs) that has played a foundational role in our understanding of these networks' stability and invariance…
We construct a nonminimal graded free resolution of Segre embeddings of $P^1\times P^1$, although we don't compute all maps. We use this to prove an explicit formula for certain nonzero entries in the graded Betti table, at the end of the…
Randomized subspace embedding methods have had a great impact on the solution of a linear least squares (LS) problem by reducing its row dimension, leading to a randomized or sketched LS (sLS) problem, and use the solution of the sLS…
A set-system $S\subseteq \{0,1\}^n$ is cube-ideal if its convex hull can be described by capacity and generalized set covering inequalities. In this paper, we use combinatorics, convex geometry, and polyhedral theory to give exponential…
Uniform bounds on sketched inner products of vectors or matrices underpin several important computational and statistical results in machine learning and randomized algorithms, including the Johnson-Lindenstrauss (J-L) lemma, the Restricted…