Related papers: Lower bounds on the M\"{u}nchhausen problem

A labeling scheme for nearest common ancestors assigns a distinct binary string, called the label, to every node of a tree, so that given the labels of two nodes (and no further information about the topology of the tree) we can compute the…

In the study of extensions of polytopes of combinatorial optimization problems, a notorious open question is that for the size of the smallest extended formulation of the Minimum Spanning Tree problem on a complete graph with $n$ nodes. The…

Let $G$ be a finite non-solvable group. We prove that there exists a proper subgroup $A$ of $G$ such that $G$ is the product of three conjugates of $A$, thus replacing an earlier upper bound of $36$ with the smallest possible value. The…

Universal compression of patterns of sequences generated by independently identically distributed (i.i.d.) sources with unknown, possibly large, alphabets is investigated. A pattern is a sequence of indices that contains all consecutive…

We provide a monotone non increasing sequence of upper bounds $f^H_k$ ($k\ge 1$) converging to the global minimum of a polynomial $f$ on simple sets like the unit hypercube. The novelty with respect to the converging sequence of upper…

In this paper we examined an algorithm for the All-k-Nearest-Neighbor problem proposed in 1980s, which was claimed to have an $O(n\log{n})$ upper bound on the running time. We find the algorithm actually exceeds the so claimed upper bound,…

In this work we propose a novel approach to investigate boundary value problems (BVPs) for fully third order differential equations. It is based on the reduction of BVPs to operator equations for the nonlinear terms but not for the…

Every real Bank-Laine function of finite order, whose zeros are all real but neither bounded above nor bounded below, either has an explicit representation in terms of trigonometric functions or has zeros with exponent of convergence at…

An integer polynomial $p$ of $n$ variables is called a \emph{threshold gate} for a Boolean function $f$ of $n$ variables if for all $x \in \zoon$ $f(x)=1$ if and only if $p(x)\geq 0$. The \emph{weight} of a threshold gate is the sum of its…

We study the number of lines in hypergraphs in a more symmetric setting, where both the hypergraph and its complement are considered. In the general case and in some special cases, the lower bounds on the number of lines are much higher…

This paper defines multidimensional sequential optimization numbers and prove that the unsigned Stirling numbers of first kind are 1-dimensional sequential optimization numbers. This paper gives a recurrence formula and an upper bound of…

In this paper we improve the lower bound of Chatterjee et al.\ (ECCC 2019) to an $\Omega(n^2)$ lower bound for unlayered Algebraic Branching Programs. We also study the impact layerization has on Algebraic Branching Programs. We exhibit a…

We show that the number of short binary signed-digit representations of an integer $n$ is equal to the $n$-th term in the Stern sequence. Various proofs are provided, including direct, bijective, and generating function proofs. We also show…

We revisit the question of existence and regularity of minimizers to weighted least gradient problems on a fixed bounded domain, subject to a Dirichlet boundary condition, in the case where the boundary data is continuous and the weight…

Let p be a prime, and let f : Z/pZ -> R be a function with average value 0 and ||f||_A <= 1, where ||f||_A denotes the algebra norm (L^1 norm of the Fourier transform). Then f(x) is small for some x, specifically min_x |f(x)| is no more…

We study boundary value problems for bounded uniform domains in $\mathbb{R}^n$, $n\geq 2$, with non-Lipschitz (and possibly fractal) boundaries. We prove Poincar\'e inequalities with trace terms and uniform constants for uniform…

We report progress on the \NL vs \UL problem. [-] We show unconditionally that the complexity class $\ReachFewL\subseteq\UL$. This improves on the earlier known upper bound $\ReachFewL \subseteq \FewL$. [-] We investigate the complexity of…

A graph $G$ of order $n$ is called edge-pancyclic if, for every integer $k$ with $3 \leq k \leq n$, every edge of $G$ lies in a cycle of length $k$. Determining the minimum size $f(n)$ of a simple edge-pancyclic graph with $n$ vertices…

This note is to study Bourgain's slicing problem following the routes investigated in the last decade. We show that the slicing constant $L_n$ is bounded by $C\log(\log n) $, $n\geq 3$, for some universal constant $C$.

We discuss several coin-weighing problems in which coins are known to be of three different weights and only a balance scale can be used. We start with the task of sorting coins when the pans of the scale can fit only one coin. We prove…