相关论文: On Circuit Diameter Bounds via Circuit Imbalances

The aim of this paper is to give an upper bound for the intrinsic diameter of a surface with boundary immersed in a conformally flat three dimensional Riemannian manifold in terms of the integral of the mean curvature and of the length of…

Calculating the diameter of an undirected graph requires quadratic running time under the Strong Exponential Time Hypothesis and this barrier works even against any approximation better than 3/2. For planar graphs with positive edge…

We give the first truly subquadratic time algorithm, with $O^*(n^{2-1/18})$ running time, for computing the diameter of an $n$-vertex unit-disk graph, resolving a central open problem in the literature. Our result is obtained as an instance…

In this paper we consider the fundamental problem of approximating the diameter $D$ of directed or undirected graphs. In a seminal paper, Aingworth, Chekuri, Indyk and Motwani [SIAM J. Comput. 1999] presented an algorithm that computes in…

We provide a variety of lower bounds for the well-known shortcut set problem: how much can one decrease the diameter of a directed graph on $n$ vertices and $m$ edges by adding $O(n)$ or $O(m)$ of shortcuts from the transitive closure of…

Set Disjointness on a Line is a variant of the Set Disjointness problem in a distributed computing scenario with $d+1$ processors arranged on a path of length $d$. It was introduced by Le Gall and Magniez (PODC 2018) for proving lower…

For a Minkowski centered convex compact set $K$ we define $\alpha(K)$ to be the smallest possible factor to cover $K \cap (-K)$ by a rescalation of $\mathrm{conv} (K\cup (-K))$ and give a complete description of the possible values of…

In a recent breakthrough, Chen, Hirahara and Ren prove that $\mathsf{S_2E}/_1 \not\subset \mathsf{SIZE}[2^n/n]$ by giving a single-valued $\mathsf{FS_2P}$ algorithm for the Range Avoidance Problem ($\mathsf{Avoid}$) that works for…

We consider minimizers of \[ F(\lambda_1(\Omega),\ldots,\lambda_N(\Omega)) + |\Omega|, \] where $F$ is a function strictly increasing in each parameter, and $\lambda_k(\Omega)$ is the $k$-th Dirichlet eigenvalue of $\Omega$. Our main result…

Based on some new robust estimators of the covariance matrix, we propose stable versions of Principal Component Analysis (PCA) and we qualify it independently of the dimension of the ambient space. We first provide a robust estimator of the…

In 1989, Ne\v{s}et\v{r}il and Pudl\'ak posed the following challenging question: Do planar posets have bounded Boolean dimension? We show that every poset with a planar cover graph and a unique minimal element has Boolean dimension at most…

Determining the number of embeddings of Laman graph frameworks is an open problem which corresponds to understanding the solutions of the resulting systems of equations. In this paper we investigate the bounds which can be obtained from the…

In 2015, Dankelmann and Bau proved that for every bridgeless graph $G$ of order $n$ and minimum degree $\delta$ there is an orientation of diameter at most $11\frac{n}{\delta+1}+9$. In 2016, Surmacs reduced this bound to…

We consider a problem of approximating the size of the largest clique in a graph, with a monotone circuit. Concretely, we focus on distinguishing a random Erd\H{o}s-Renyi graph $\mathcal{G}_{n,p}$, with $p=n^{-\frac{2}{\alpha-1}}$ chosen…

In this paper, we consider bounded width circuits and nondeterministic circuits in three somewhat new directions. In the first part of this paper, we mainly consider bounded width circuits. The main purpose of this part is to prove that…

We consider the problem of minimising the $k$-th eigenvalue of the Laplacian with some prescribed boundary condition over collections of convex domains of prescribed perimeter or diameter. It is known that these minimisation problems are…

The Hirsch conjecture, posed in 1957, stated that the graph of a $d$-dimensional polytope or polyhedron with $n$ facets cannot have diameter greater than $n - d$. The conjecture itself has been disproved, but what we know about the…

We study the size blow-up that is necessary to convert an algebraic circuit of product-depth $\Delta+1$ to one of product-depth $\Delta$ in the multilinear setting. We show that for every positive $\Delta = \Delta(n) = o(\log n/\log \log…

We establish a generic form of hardness amplification for the approximability of constant-depth Boolean circuits by polynomials. Specifically, we show that if a Boolean circuit cannot be pointwise approximated by low-degree polynomials to…

We reduce the problem of proving deterministic and nondeterministic Boolean circuit size lower bounds to the analysis of certain two-dimensional combinatorial cover problems. This is obtained by combining results of Razborov (1989),…