Related papers: Positive spectrahedra: Invariance principles and P…
We describe a new scheme for evolving the equations of force-free electrodynamics, the vanishing-inertia limit of magnetohydrodynamics. This pseudospectral code uses global orthogonal basis function expansions to take accurate spatial…
We prove a strongly polynomial bound on the circuit diameter of polyhedra, resolving the circuit analogue of the polynomial Hirsch conjecture. Specifically, we show that the circuit diameter of a polyhedron $P = \{x\in \mathbb{R}^n:\, A x =…
We give a "regularity lemma" for degree-d polynomial threshold functions (PTFs) over the Boolean cube {-1,1}^n. This result shows that every degree-d PTF can be decomposed into a constant number of subfunctions such that almost all of the…
Spectrahedra are affine sections of the cone of positive semidefinite matrices which form a rich class of convex bodies that properly contains that of polyhedra. While the class of polyhedra is closed under linear projections, the class of…
We consider the generation of randomness based upon the observed violation of an Einstein-Podolsky-Rosen (EPR) steering inequality, known as one-sided device-independent randomness expansion. We show that in the simplest scenario --…
We present a new algorithm for generating a uniformly random spanning tree in an undirected graph. Our algorithm samples such a tree in expected $\tilde{O}(m^{4/3})$ time. This improves over the best previously known bound of…
A randomized algorithm for a search problem is *pseudodeterministic* if it produces a fixed canonical solution to the search problem with high probability. In their seminal work on the topic, Gat and Goldwasser posed as their main open…
We present an explicit pseudorandom generator for oblivious, read-once, permutation branching programs of constant width that can read their input bits in any order. The seed length is $O(\log^2 n)$, where $n$ is the length of the branching…
We propose a method for quantifying uncertainty in high-dimensional PDE systems with random parameters, where the number of solution evaluations is small. Parametric PDE solutions are often approximated using a spectral decomposition based…
A new method is discussed for the systematic synthesis, design and performance optimization of varactor-based parametric frequency dividers (PFDs) exhibiting an ultra-low power threshold ($P_{th}$). For the first time, it is analytically…
We study the probabilistic degree over reals of the OR function on $n$ variables. For an error parameter $\epsilon$ in (0,1/3), the $\epsilon$-error probabilistic degree of any Boolean function $f$ over reals is the smallest non-negative…
Band theory provides the foundation for understanding electronic structure in crystalline materials, but its reliance on exact translational symmetry limits its applicability to systems with defects, disorder, incommensurate modulations, or…
Understanding the behavior of deep networks is crucial to increase our confidence in their results. Despite an extensive body of work for explaining their predictions, researchers have faced reliability issues, which can be attributed to…
We characterize the existence of certain geometric configurations in the fractal percolation limit set $A$ in terms of the almost sure dimension of $A$. Some examples of the configurations we study are: homothetic copies of finite sets,…
We introduce a new tensor norm, the average spectrum norm, to study sample complexity of tensor completion problems based on the canonical polyadic decomposition (CPD). Properties of the average spectrum norm and its dual norm are…
Strict positive realness (SPR) is an important concept in absolute stability theory, adaptive control, system identification, etc. This paper characterizes the strictly positive real regions in coefficient space and presents a robust design…
Stochastic expansion-based methods of uncertainty quantification, such as polynomial chaos and separated representations, require basis functions orthogonal with respect to the density of random inputs. Many modern engineering problems…
In this paper, we focus on analyzing the period distribution of the inversive pseudorandom number generators (IPRNGs) over finite field $({\rm Z}_{N},+,\times)$, where $N>3$ is a prime. The sequences generated by the IPRNGs are transformed…
The notion of eta invariant is traditionally defined by means of analytic continuation. We prove, by examining the particular case of the operator curl, that the eta invariant can equivalently be obtained as the trace of the difference of…
We study the spectra and pseudospectra of finite and infinite tridiagonal random matrices, in the case where each of the diagonals varies over a separate compact set, say $U,V,W\subset\mathbb{C}$. Such matrices are sometimes termed…