Related papers: Consensus Division in an Arbitrary Ratio

We show that every $\alpha$-approximate minimum cut in a connected graph is the unique minimum $(S,T)$-terminal cut for some subsets $S$ and $T$ of vertices each of size at most $\lfloor2\alpha\rfloor+1$. This leads to an alternative proof…

We provide approximation algorithms for two problems, known as NECKLACE SPLITTING and $\epsilon$-CONSENSUS SPLITTING. In the problem $\epsilon$-CONSENSUS SPLITTING, there are $n$ non-atomic probability measures on the interval $[0, 1]$ and…

Minimum $k$-Section denotes the NP-hard problem to partition the vertex set of a graph into $k$ sets of sizes as equal as possible while minimizing the cut width, which is the number of edges between these sets. When $k$ is an input…

We establish the satisfiability threshold for random $k$-SAT for all $k\ge k_0$, with $k_0$ an absolute constant. That is, there exists a limiting density $\alpha_*(k)$ such that a random $k$-SAT formula of clause density $\alpha$ is with…

Given a graph $G = (V,E)$, an $(\alpha, \beta)$-ruling set is a subset $S \subseteq V$ such that the distance between any two vertices in $S$ is at least $\alpha$, and the distance between any vertex in $V$ and the closest vertex in $S$ is…

For an irrational real $\alpha$ and $\gamma\not \in \mathbb Z + \mathbb Z\alpha$ it is well known that $$ \liminf_{|n|\rightarrow \infty} |n| ||n\alpha -\gamma || \leq \frac{1}{4}. $$ If the partial quotients, $a_i,$ in the negative…

We count algebraic points of bounded height and degree on the graphs of certain functions analytic on the unit disk, obtaining a bound which is polynomial in the degree and in the logarithm of the multiplicative height. We combine this work…

We study the problem of finding an exact solution to the consensus halving problem. While recent work has shown that the approximate version of this problem is PPA-complete, we show that the exact version is much harder. Specifically,…

In 1946 Erd\H os asked for the maximum number of unit distances, $u(n)$, among $n$ points in the plane. He showed that $u(n)> n^{1+c/\log\log n}$ and conjectured that this was the true magnitude. The best known upper bound is…

In this paper we consider one particular mathematical problem of this large area of fractional powers of self-adjoined elliptic operators, defined either by Dunford-Taylor-like integrals or by the representation through the spectrum of the…

For an irrational number $\alpha\in\mathbb{R}$ we consider its irrationality measure function $$ \psi_\alpha(x) = \min_{1\le q\le x,\, q\in\mathbb{Z}} \| q\alpha \|. $$ It is known for all irrational numbers $\alpha$ and $\beta$ satisfying…

Given an edge-colored graph, the goal of the proportional fair matching problem is to find a maximum weight matching while ensuring proportional representation (with respect to the number of edges) of each color. The colors may correspond…

In this paper, we develop a parameterized proximal point algorithm (P-PPA) for solving a class of separable convex programming problems subject to linear and convex constraints. The proposed algorithm is provable to be globally convergent…

Given a connected set $\Omega_0 \subset \mathbb{R}^2$, define a sequence of sets $(\Omega_n)_{n=0}^{\infty}$ where $\Omega_{n+1}$ is the subset of $\Omega_n$ where the first eigenfunction of the (properly normalized) Neumann $p-$Laplacian $…

We consider partitions of a point set into two parts, and the lengths of the minimum spanning trees of the original set and of the two parts. If $w(P)$ denotes the length of a minimum spanning tree of $P$, we show that every set $P$ of $n…

We consider the problem of enumerating optimal solutions for two hypergraph $k$-partitioning problems -- namely, Hypergraph-$k$-Cut and Minmax-Hypergraph-$k$-Partition. The input in hypergraph $k$-partitioning problems is a hypergraph…

For every irrational real $\alpha$, let $M(\alpha) = \sup_{n\geq 1} a_n(\alpha)$ denote the largest partial quotient in its continued fraction expansion (or $\infty$, if unbounded). The $2$-adic Littlewood conjecture (2LC) can be stated as…

Propositional satisfiability (SAT) is one of the most fundamental problems in computer science. The worst-case hardness of SAT lies at the core of computational complexity theory. The average-case analysis of SAT has triggered the…

We consider upper exponential bounds for the probability of the event that an absolute deviation of sample mean from mathematical expectation p is bigger comparing with some ordered level epsilon. These bounds include 2 coefficients {alpha,…

$\newcommand{\Arr}{\mathcal{A}} \newcommand{\numS}{k} \newcommand{\ArrX}[1]{\Arr(#1)} \newcommand{\eps}{\varepsilon} \newcommand{\opt}{\mathsf{o}}$ For point sets $P_1, \ldots, P_\numS$, a set of lines $L$ is halving if any face of the…