Related papers: Constructing Maximal Bumpless Pipedreams for Doubl…
Expander graphs, due to their mixing properties, are useful in many algorithms and combinatorial constructions. One can produce an expander graph with high probability by taking a random graph (e.g., the union of $d$ random bijections for a…
We study quasifinite highest weight modules over the supersymmetric extension of the $W_{1+\infty}$ algebra on the basis of the analysis by Kac and Radul. We find that the quasifiniteness of the modules is again characterized by…
Given a positive integer n and a positive semidefinite matrix A = (A_{ij}) of size m x m, the positive semidefinite Grothendieck problem with rank-n-constraint (SDP_n) is maximize \sum_{i=1}^m \sum_{j=1}^m A_{ij} x_i \cdot x_j, where x_1,…
This paper deals with developing techniques for the reconstruction of high-dimensional datasets given each bivariate projection, as would be found in a matrix scatterplot. A graph-based solution is introduced, involving clique-finding,…
Pseudo-random arrays and perfect maps are the two-dimensional analogs of M-sequences and de Bruijn sequences, respectively. We modify the definitions to be applied to codes. These codes are also the two-dimensional analogs of certain…
We investigate the joint distribution of the vertex degrees in three models of random bipartite graphs. Namely, we can choose each edge with a specified probability, choose a specified number of edges, or specify the vertex degrees in one…
Recent results from real algebraic geometry and the theory of polynomial optimization are related in a new framework to the existence question of multivariate tight wavelet frames whose generators have at least one vanishing moment. Namely,…
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 study the convex relaxation of a polynomial optimization problem, maximizing a product of linear forms over the complex sphere. We show that this convex program is also a relaxation of the permanent of Hermitian positive semidefinite…
We design polynomial size, constant depth (namely, $\mathsf{AC}^0$) arithmetic formulae for the greatest common divisor (GCD) of two polynomials, as well as the related problems of the discriminant, resultant, B\'ezout coefficients,…
Let d1,...,dn be a strictly increasing sequence of integers. Boij and S\"oderberg [arXiv:math/0611081] have conjectured the existence of a graded module M of finite length over any polynomial ring K[x_1,..., x_n], whose minimal free…
Grothendieck-Witt spectra represent higher Grothendieck-Witt groups and higher Hermitian K-theory in particular. A description of the Grothendieck-Witt spectrum of a finite dimensional projective bundle $\mathbb{P}(\mathcal{E})$ over a base…
We present algorithms for basic computations with monoids in finitely generated abelian groups such as monoid membership testing and computing an element of the conductor ideal. Applying them to Mori dream spaces, we obtain algorithms to…
The interpolation step of Guruswami and Sudan's list decoding of Reed-Solomon codes poses the problem of finding the minimal polynomial of an ideal with respect to a certain monomial order. An efficient algorithm that solves the problem is…
A bifibration structure on a $6$-manifold is a map to either the complex projective plane $\mathbb{P}^2$ or a $\mathbb{P}^1$-bundle over $\mathbb{P}^1$, such that its composition with the projection to $\mathbb{P}^1$ is a ($6$-dimensional)…
This paper puts forward a new generalized polynomial dimensional decomposition (PDD), referred to as GPDD, comprising hierarchically ordered measure-consistent multivariate orthogonal polynomials in dependent random variables. Unlike the…
We consider the problem of maximizing the sum of a monotone submodular function and a linear function subject to a general solvable polytope constraint. Recently, Sviridenko et al. (2017) described an algorithm for this problem whose…
Branched covers of the complex projective line ramified over $0,1$ and $\infty$ (Grothendieck's {\em dessins d'enfant}) of fixed genus and degree are effectively enumerated. More precisely, branched covers of a given ramification profile…
A surprising 'converse to the polynomial method' of Aaronson et al. (CCC'16) shows that any bounded quadratic polynomial can be computed exactly in expectation by a 1-query algorithm up to a universal multiplicative factor related to the…
Certifying the positivity of trigonometric polynomials is of first importance for design problems in discrete-time signal processing. It is well known from the Riesz-Fej\'ez spectral factorization theorem that any trigonometric univariate…