Related papers: Conant's Metric Spectra Problem
The at-most-k constraint is ubiquitous in combinatorial problems, and numerous SAT encodings are available for the constraint. Prior experiments have shown the competitiveness of the sequential-counter encoding for k $>$ 1, and have…
We consider Cantor measures on the line, with contraction factor $N^{-1}=p^{-\alpha}$ (where $p$ a positive prime, $\alpha$ a positive integer) and $m$ positive integer digits lying in distinct residue classes modulo $N$. We obtain a…
We study the decision version of tensor spectral norm from the viewpoint of real algebraic complexity. For a rationally specified tensor, the tensor spectral threshold problem asks whether its spectral norm exceeds a prescribed rational…
Let $\sigma_n$ denote the largest mode-$n$ multilinear singular value of an $I_1\times\dots \times I_N$ tensor $\mathcal T$. We prove that $$ \sigma_1^2+\dots+\sigma_{n-1}^2+\sigma_{n+1}^2+\dots+\sigma_{N}^2\leq (N-2)\|\mathcal T\|^2 +…
A popular method in combinatorial optimization is to express polytopes P, which may potentially have exponentially many facets, as solutions of linear programs that use few extra variables to reduce the number of constraints down to a…
We consider equally-weighted Cantor measures $\mu_{q,b}$ arising from iterated function systems of the form ${b^{-1}(x+i)}$, $i=0,1,...,q-1$, where $q<b$. We classify the $(q,b)$ so that they have infinitely many mutually orthogonal…
We show that single-valuation exponential kernels, under mild regularity assumptions, converge in the continuum limit to a fourth-order operator with heat asymptotics $\Theta(t)\sim t^{-1/4}$ and hence spectral dimension $d_s=\tfrac12$.…
Given the norms of powers $(\lVert x^n\rVert)_{n\geq 0}$ of a Banach algebra element $x$, the largest possible value of the minimum modulus on the spectrum of $x$ is determined. It is also shown that, given a Banach algebra element $x$ and…
For convex optimization problems Bregman divergences appear as regret functions. Such regret functions can be defined on any convex set but if a sufficiency condition is added the regret function must be proportional to information…
We consider a problem that involves finding similar elements in a collection of sets. The problem is motivated by applications in machine learning and pattern recognition. We formulate the similar elements problem as an optimization and…
In this prelinimary version of paper, we propose to give a complete solution to the Truncated Multidimensional Trigonometric Moment Problem (TMTMP) from a system and signal processing perspective. In mathematical TMTMPs, people care about…
Hitting Set is a classic problem in combinatorial optimization. Its input consists of a set system F over a finite universe U and an integer t; the question is whether there is a set of t elements that intersects every set in F. The Hitting…
Let $\mathcal{T}$ be a finite nonempty set of $3$-element subsets of a totally ordered set $V$. We view $\mathcal{T}$ as the set of triangles in the support graph. Let $\delta_{1,\mathcal{T}}$ be the signed edge-triangle incidence matrix,…
Let $\mathcal{T}_n$ be the set of all mappings $T:[n]\to[n]$, where $[n]=\{1,2,\ldots,n\}$. The corresponding graph $G_T$ of $T$, called a functional digraph, is a union of disjoint connected components. Each component is a directed cycle…
This paper discusses a general method for spectral type theorems using metric spaces instead of vector spaces. Advantages of this approach are that it applies to genuinely non-linear situations and also to random versions. Metric analogs of…
We improve the state-of-the-art proof techniques for realizing various spectra of $\mathfrak{a}_{\text{T}}$ in order to realize arbitrarily large spectra. Thus, we make significant progress in addressing a question posed by Brian in his…
While Spectral Methods have long been used for Principal Component Analysis, this survey focusses on work over the last 15 years with three salient features: (i) Spectral methods are useful not only for numerical problems, but also discrete…
Let $G$ be a finite abelian group and $A$ a subset of $G$. The spectrum of $A$ is the set of its large Fourier coefficients. Known combinatorial results on the structure of spectrum, such as Chang's theorem, become trivial in the regime…
Given a set of $n$ points $P$ in the plane, each colored with one of the $t$ given colors, a color-spanning set $S\subset P$ is a subset of $t$ points with distinct colors. The minimum diameter color-spanning set (MDCS) is a color-spanning…
A spectrahedron is a set defined by a linear matrix inequality. Given a spectrahedron we are interested in the question of the smallest possible size $r$ of the matrices in the description by linear matrix inequalities. We show that for the…