Related papers: Erdos-Szekeres tableaux
We introduce the $st$-cut version the Sparsest-Cut problem, where the goal is to find a cut of minimum sparsity among those separating two distinguished vertices $s,t\in V$. Clearly, this problem is at least as hard as the usual (non-$st$)…
In this paper, we begin the exploration of vertex-ordering problems through the lens of exponential-time approximation algorithms. In particular, we ask the following question: Can we simultaneously beat the running times of the fastest…
Inspired by a chessboard puzzle of Dudeney, the general position problem in graph theory asks for a largest set $S$ of vertices in a graph such that no three elements of $S$ lie on a common shortest path. The number of vertices in such a…
An elliptic relative equilibrium (ERE) is a special solution of the planar $N$-body problem generated by a central configuration. Its linear stability depends on the eccentricity $e$ and the masses of the bodies. However, for $e>0$, the…
A common problem in the sciences is that a signal of interest is observed only indirectly, through smooth functionals of the signal whose values are then obscured by noise. In such inverse problems, the functionals dampen or entirely…
The main goal of this paper is to develop a concept of approximate differentiability of higher order for subsets of the Euclidean space that allows to characterize higher order rectifiable sets, extending somehow well known facts for…
A collection of integer sequences is jointly ergodic if for every ergodic measure preserving system the multiple ergodic averages, with iterates given by this collection of sequences, converge in the mean to the product of the integrals. We…
In additive combinatorics, Erd\"{o}s-Szemer\'{e}di Conjecture is an important conjecture. It can be applied to many fields, such as number theory, harmonic analysis, incidence geometry, and so on. Additionally, its statement is quite easy…
In this note, we present a substantial improvement on the computational complexity of the Erd\"{o}s-Szekeres partitioning problem and review recent works on dynamic \textsf{LIS}.
The Euler Characteristic Transform (ECT) is a robust method for shape classification. It takes an embedded shape and, for each direction, computes a piecewise constant function representing the Euler Characteristic of the shape's sublevel…
In this work, we develop an efficient high order discontinuous Galerkin (DG) method for solving the Electrical Impedance Tomography (EIT). EIT is a highly nonlinear ill-posed inverse problem where the interior conductivity of an object is…
Given a graph $G$, the (graph theory) general position problem is to find the maximum number of vertices such that no three vertices lie on a common geodesic. This graph invariant is called the general position number (gp-number for short)…
We present a matrix-theoretic approach for studying and enumerating finite posets through their incidence representations, referred to as poset matrices. Naturally labelled posets are encoded as Boolean lower triangular matrices, allowing a…
The distance set $\Delta(E)$ of a set $E$ consists of all non-negative numbers that represent distances between pairs of points in $E$. This paper studies sparse (less than full-dimensional) Borel sets in $\mathbb R^d$, $d \geq 2$ with a…
Let $ES_{d}(n)$ be the smallest integer such that any set of $ES_{d}(n)$ points in $\mathbb{R}^{d}$ in general position contains $n$ points in convex position. In 1960, Erd\H{o}s and Szekeres showed that $ES_{2}(n) \geq 2^{n-2} + 1$ holds,…
The goal of graph inference is to design algorithms for learning properties of a hidden graph using queries to an oracle that returns information about the graph. Graph reconstruction, verification, and property testing are all types of…
We study a variant of Erd\H os' unit distance problem, concerning dot products between successive pairs of points chosen from a large finite point set. Specifically, given a large finite set of $n$ points $E$, and a sequence of nonzero dot…
In this paper, we propose a novel kind of numerical approximations to inherit the ergodicity of stochastic Maxwell equations. The key to proving the ergodicity lies in the uniform regularity estimates of the numerical solutions with respect…
Our main result is a limit shape theorem for the two-dimensional surface defined by a uniform random n-by-n square Young tableau. The analysis leads to a calculus of variations minimization problem that resembles the minimization problems…
Let $q$ be a power of a prime number and $V$ be the $2$-dimensional column vector space over a finite field $\mathbb{F}_{q}$. Assume that $SL_2(V)<G\leq GL_2(V)$. In this paper we prove an Erd{\H{o}}s-Ko-Rado theorem for intersecting sets…