Related papers: Uniform semi-Latin squares and their pairwise-vari…

Finding cliques in random graphs and the closely related "planted" clique variant, where a clique of size k is planted in a random G(n, 1/2) graph, have been the focus of substantial study in algorithm design. Despite much effort, the best…

We use the Sum of Squares method to develop new efficient algorithms for learning well-separated mixtures of Gaussians and robust mean estimation, both in high dimensions, that substantially improve upon the statistical guarantees achieved…

Symmetry-based ideas, such as the quark-lepton complementarity (QLC) principle and the tri-bimaximal mixing (TBM) scheme, have been proposed to explain the observed mixing pattern of neutrinos. We argue that such symmetry relations need to…

We identify locally $D$-optimal crossover designs for generalized linear models. We use generalized estimating equations to estimate the model parameters along with their variances. To capture the dependency among the observations coming…

We study separable plus quadratic (SPQ) polynomials, i.e., polynomials that are the sum of univariate polynomials in different variables and a quadratic polynomial. Motivated by the fact that nonnegative separable and nonnegative quadratic…

We prove three main results about semialgebraic hypergraphs. First, we prove an optimal and oblivious regularity lemma. Fox, Pach, and Suk proved that the class of $k$-uniform semialgebraic hypergraphs satisfies a very strong regularity…

We present an $O(mn)$ direct least-squares solver for $m \times n$ linear systems with a scaled partial isometry. The proposed algorithm is also useful when the system is block diagonal and each block is a scaled partial isometry with…

The n-way number partitioning problem, a fundamental challenge in combinatorial optimization, has significant implications for applications such as fair division and machine scheduling. Despite these problems being NP-hard, many…

We consider the problem of reconstructing an unknown function $f$ on a domain $X$ from samples of $f$ at $n$ randomly chosen points with respect to a given measure $\rho_X$. Given a sequence of linear spaces $(V_m)_{m>0}$ with ${\rm…

Given a partition $h_1+h_2+\dots+h_k = n$, a latin square of order $n$ with pairwise disjoint subsquares of orders $h_1,\dots ,h_k$ is called a realization. When the values $h_i$ are of at most two sizes, the existence of a realization has…

There exist few examples of negative Latin square type partial difference sets (NLST PDSs) in nonabelian groups. We present a list of 176 inequivalent NLST PDSs in 48 nonisomorphic, nonabelian groups of order 64. These NLST PDSs form 8…

The dimension of a block design is the maximum positive integer $d$ such that any $d$ of its points are contained in a proper subdesign. Pairwise balanced designs PBD$(v,K)$ have dimension at least two as long as not all points are on the…

An asymptotically optimal blind calibration scheme of uniform linear arrays for narrowband Gaussian signals is proposed. Rather than taking the direct Maximum Likelihood (ML) approach for joint estimation of all the unknown model…

We investigate sets of Mutually Orthogonal Latin Squares (MOLS) generated by Cellular Automata (CA) over finite fields. After introducing how a CA defined by a bipermutive local rule of diameter $d$ over an alphabet of $q$ elements…

The selection of best variables is a challenging problem in supervised and unsupervised learning, especially in high dimensional contexts where the number of variables is usually much larger than the number of observations. In this paper,…

This paper is concerned with the problem of finding $n$ distinct squares such that, on excluding any one of them, the sum of the remaining $n-1$ squares is a square. While parametric solutions are known when $n=3$ and $n=4$, when $n > 4$,…

In this paper we formulate and solve a robust least squares problem for a system of linear equations subject to quantization error in the data matrix. Ordinary least squares fails to consider uncertainty in the operator, modeling all noise…

Given an integer partition $P = (h_1h_2\dots h_k)$ of $n$, a realization of $P$ is a latin square with disjoint subsquares of orders $h_1,h_2,\dots,h_k$. Most known results restrict either $k$ or the number of different integers in $P$.…

We revisit a formulation technique for inequality constrained optimization problems that has been known for decades: the substitution of squared variables for nonnegative variables. Using this technique, inequality constraints are converted…

Since the theorems of Schur and van der Waerden, numerous partition regularity results have been proved for linear equations, but progress has been scarce for non-linear ones, the hardest case being equations in three variables. We prove…