Related papers: Combinatorial designs and the Prouhet--Tarry--Esco…
Correlated with the trend of increasing degrees of freedom in robotic systems is a similar trend of rising interest in Spatio-Temporal systems described by Partial Differential Equations (PDEs) among the robotics and control communities.…
Inclusion-based (i.e., Andersen-style) points-to analysis is a fundamental static analysis problem. The seminal work of Andersen gave a worst-case cubic $O(n^3)$ time points-to analysis algorithm for C, where $n$ is proportional to the…
We introduce the notion of additive units, or `addits', of a pointed Arveson system, and demonstrate their usefulness through several applications. By a pointed Arveson system we mean a spatial Arveson system with a fixed normalised…
Integer compositions restricted by inequalities on certain pairs of parts were first considered by J\"{o}rg Arndt in 2013 and several variations have been studied recently. Here we consider a broad two-parameter generalization that scales…
Linear elastic fracture mechanics admit analytic solutions that have low regularity at crack tips. Current numerical methods for partial differential equations (PDEs) of this type suffer from the constraint of such low regularity, and fail…
We present a new construction of triple arrays by combining a symmetric 2-design with a resolution of another 2-design. This is the first general method capable of producing non-extremal triple arrays. We call the triple arrays which can be…
In this paper we study nonconvex and nonsmooth multi-block optimization over Riemannian manifolds with coupled linear constraints. Such optimization problems naturally arise from machine learning, statistical learning, compressive sensing,…
We survey recent (and not so recent) results concerning arrangements of lines, points and other geometric objects and the applications these results have in theoretical computer science and combinatorics. The three main types of problems we…
The theory of complete generalized Jordan sets is employed to reduce the PDE with the irreversible linear operator $B$ of finite index to the regular problems. It is demonstrated how the question of the choice of boundary conditions is…
With the rapid growth of data in modern applications, parallel algorithms for maximizing non-monotone submodular functions have gained significant attention. In the parallel computation setting, the state-of-the-art approximation ratio of…
This paper begins by extending the notion of a combinatorial configuration of points and lines to a combinatorial configuration of points and planes that we refer to as configurations of order $2$. We then proceed to investigate a further…
Let $f_r(d,s_1,\ldots,s_r)$ denote the least integer $n$ such that every $n$-point set $P\subseteq\mathbb{R}^d$ admits a partition $P=P_1\cup\cdots\cup P_r$ with the property that for any choice of $s_i$-convex sets $C_i\supseteq P_i$…
A Ryser design $\mathcal{D}$ on $v$ points is a collection of $v$ proper subsets (called blocks) of a point-set with $v$ points satisfying (i) every two blocks intersect each other in $\lambda$ points for a fixed $\lambda < v$ (ii) there…
Probabilistic solvers for ordinary differential equations (ODEs) have emerged as an efficient framework for uncertainty quantification and inference on dynamical systems. In this work, we explain the mathematical assumptions and detailed…
Uncertainty quantification (UQ) has received much attention in the literature in the past decade. In this context, Sparse Polynomial chaos expansions (PCE) have been shown to be among the most promising methods because of their ability to…
A useful heuristic in the understanding of large random combinatorial structures is the Arratia-Tavare principle, which describes an approximation to the joint distribution of component-sizes using independent random variables. The…
In this article I study pairing of two interacting particles in ideal 1D, 2D and Bethe lattices. I employ the method of recursion that has been formulated recently by Berciu et. al. to compute the pair functions in real space without…
Unitary t-designs are distributions on the unitary group whose first t moments appear maximally random. Previous work has established several upper bounds on the depths at which certain specific random quantum circuit ensembles approximate…
This paper considers a framework for combinatorial variants of perpetual-scheduling problems. Given an independence system $(E,\mathcal{I})$, a schedule consists of an independent set $I_t \in \mathcal{I}$ for every time step $t \in…
Strongly interacting systems can be described in terms of correlation functions at various orders. A quantum analog of high-order correlations is the topological entanglement in topologically ordered states of matter at zero temperature,…