Related papers: Polynomial-Sized Topological Approximations Using …
We here calculate the series expansion of the T-matrix for a spheroidal particle in the small-size/long-wavelength limit, up to third lowest order with respect to the size parameter, X, which we will define rigorously for a non-spherical…
In this paper, we introduce the problem of Matroid-Constrained Vertex Cover: given a graph with weights on the edges and a matroid imposed on the vertices, our problem is to choose a subset of vertices that is independent in the matroid,…
The ability to efficiently solve topology optimization problems is of great importance for many practical applications. Hence, there is a demand for efficient solution algorithms. In this paper, we propose novel quasi-Newton methods for…
This thesis presents new applications of Gale duality to the study of polytopes, point configurations and oriented matroids with extremal combinatorial properties. The first part of the thesis explores construction techniques for neighborly…
We study the problem of computing an approximate maximum cardinality matching in the semi-streaming model when edges arrive in a \emph{random} order. In the semi-streaming model, the edges of the input graph G = (V,E) are given as a stream…
We give an $\alpha(1+\epsilon)$-approximation algorithm for solving covering LPs, assuming the presence of a $(1/\alpha)$-approximation algorithm for a certain optimization problem. Our algorithm is based on a simple modification of the…
Polytopal methods provide a flexible framework for the numerical approximation of partial differential equations on general meshes. Their convergence analysis raises specific challenges due to their inherently non-conforming nature and, in…
An old open problem in graph drawing asks for the size of a universal point set, a set of points that can be used as vertices for straight-line drawings of all n-vertex planar graphs. We connect this problem to the theory of permutation…
We revisit the problem of estimating the profile (also known as the rarity) in the data stream model. Given a sequence of $m$ elements from a universe of size $n$, its profile is a vector $\phi$ whose $i$-th entry $\phi_i$ represents the…
Fluid models are a popular formalism in the quantitative modeling of biochemical systems and analytical performance models. The main idea is to approximate a large-scale Markov chain by a compact set of ordinary differential equations…
In this paper, we present an improved numerical algorithm for computing the intersection area of multiple circles and a complex polygon efficiently. This geometric problem is fundamental to applications such as wireless sensor networks and…
Obtaining the low-energy configurations of spin glasses that have rugged energy landscapes is of direct relevance to combinatorial optimization and fundamental science. Search-based heuristics have difficulty with this task due to the…
Linear optical spectra of molecular aggregates are often approximated by classical optics methods such as the discrete-dipole approximation (DDA), coherent exciton scattering (CES), and coherent potential approximation (CPA), where the only…
Matrix configurations define noncommutative spaces endowed with extra structure including a generalized Laplace operator, and hence a metric structure. Made dynamical via matrix models, they describe rich physical systems including…
In this paper we pursue a new technique to search for evidence of a finite Universe, making use of a spherical mexican-hat wavelet decomposition of the microwave background fluctuations. Using the information provided by the wavelet…
We introduce numerical methods for the approximation of the main (global) quantities in Pluripotential Theory as the \emph{extremal plurisubharmonic function} $V_E^*$ of a compact $\mathcal L$-regular set $E\subset \C^n$, its…
LP-type problems such as the Minimum Enclosing Ball (MEB), Linear Support Vector Machine (SVM), Linear Programming (LP), and Semidefinite Programming (SDP) are fundamental combinatorial optimization problems, with many important…
The Planar Graph Metric Compression Problem is to compactly encode the distances among $k$ nodes in a planar graph of size $n$. Two na\"ive solutions are to store the graph using $O(n)$ bits, or to explicitly store the distance matrix with…
Recently, 3D point cloud classification has made significant progress with the help of many datasets. However, these datasets do not reflect the incomplete nature of real-world point clouds caused by occlusion, which limits the practical…
We develop a toric topological framework for studying the cohomology of Vietoris--Rips complexes $VR(Q_n;r)$ of hypercube graphs. Using total domination invariants and spectral methods, we establish general lower bounds on connectivity,…