English
Related papers

Related papers: Towards a CFSG-free diameter bound for $\mathrm{Al…

200 papers

Binary Decision Diagrams (BDDs) are widely used for the representation of Boolean functions. Context-Free-Language Ordered Decision Diagrams (CFLOBDDs) are a plug-compatible replacement for BDDs -- roughly, they are BDDs augmented with a…

Symbolic Computation · Computer Science 2024-11-25 Xusheng Zhi , Thomas Reps

In a seminal paper of Charikar et al.~on the smallest grammar problem, the authors derive upper and lower bounds on the approximation ratios for several grammar-based compressors. Here we improve the lower bound for the famous {\sf RePair}…

Data Structures and Algorithms · Computer Science 2017-03-20 Danny Hucke , Artur Jez , Markus Lohrey

For each integer $g\geq 1$ we use variational methods to construct in the unit $3$-ball $B$ a free boundary minimal surface $\Sigma_g$ of symmetry group $\mathbb{D}_{g+1}$. For $g$ large, $\Sigma_g$ has three boundary components and genus…

Differential Geometry · Mathematics 2016-12-28 Daniel Ketover

Given a large data matrix $A\in\mathbb{R}^{n\times n}$, we consider the problem of determining whether its entries are i.i.d. with some known marginal distribution $A_{ij}\sim P_0$, or instead $A$ contains a principal submatrix $A_{{\sf…

Computational Complexity · Computer Science 2015-02-24 Yash Deshpande , Andrea Montanari

Obtaining a non-trivial (super-linear) lower bound for computation of the Fourier transform in the linear circuit model has been a long standing open problem for over 40 years. An early result by Morgenstern from 1973, provides an $\Omega(n…

Computational Complexity · Computer Science 2014-07-25 Nir Ailon

Feigin and Shoikhet conjectured in math/0610410 that successive quotients $B_m(A_n)$ of the lower central series filtration of a free associative algebra $A_n$ have polynomial growth. In this paper we give a proof of this conjecture, using…

Rings and Algebras · Mathematics 2008-03-27 G. Dobrovolska , P. Etingof

We prove that finite entropy random walks on the torsion-free Baumslag group in dimension $d=2$ have non-trivial Poisson boundary. This is in contrast with the torsion case where the situation for simple random walks on Baumslag groups is…

Group Theory · Mathematics 2023-05-23 Anna Erschler , Josh Frisch , Mark Rychnovsky

A pair of probability distributions over $\{0,1\}^n$ is said to be $(k,\delta)$-wise indistinguishable if all of the size $k$ marginals are within statistical distance at most $\delta$. Previous works introduced this concept and study when…

Computational Complexity · Computer Science 2026-05-14 Christopher Williamson

In 2013, Koldobsky posed the problem to find a constant $d_n$, depending only on the dimension $n$, such that for any origin-symmetric convex body $K\subset\mathbb{R}^n$ there exists an $(n-1)$-dimensional linear subspace…

Metric Geometry · Mathematics 2024-01-26 Ansgar Freyer , Martin Henk

We study the discrete graph-metric analogue of Gromov's filling area problem for the cycle graph \(C_n\). An abstract triangulation \(K\) is an isometric filling of \(C_n\) if \(\partial K=C_n\) and the graph distance between any two…

Differential Geometry · Mathematics 2026-05-12 Runtai He

Given a permutation group $G$ on a finite set $\Omega$, let $G^{(k)}$ denote the $k$-closure of $G$, that is, the largest permutation group on $\Omega$ having the same orbits in the induced action on $\Omega^k$ as $G$. Recall that a group…

Group Theory · Mathematics 2025-09-05 Ilia Ponomarenko , Saveliy V. Skresanov , Andrey V. Vasil'ev

Central limit theorems (CLTs) for high-dimensional random vectors with dimension possibly growing with the sample size have received a lot of attention in the recent times. Chernozhukov et al. (2017) proved a Berry--Esseen type result for…

Statistics Theory · Mathematics 2019-06-26 Arun Kumar Kuchibhotla , Somabha Mukherjee , Debapratim Banerjee

In 1992, Kalai and Kleitman proved the first subexponential upper bound for the diameters of convex polyhedra. Eisenbrand et al. proved this bound holds for connected layer families, a novel approach to analyzing polytope diameters. Very…

Combinatorics · Mathematics 2014-12-19 J. Mackenzie Gallagher , Edward D. Kim

We extend the method of Ghasemi and Marshall [SIAM. J. Opt. 22(2) (2012), pp 460-473], to obtain a lower bound $f_{{\rm gp},M}$ for a multivariate polynomial $f(x) \in \mathbb{R}[x]$ of degree $ \le 2d$ in $n$ variables $x = (x_1,...,x_n)$…

Optimization and Control · Mathematics 2013-12-16 Mehdi Ghasemi , Jean Bernard Lasserre , Murray Marshall

In a recent article (2022) we proved with L. Zaj\'i\v{c}ek that if $ G\subset\R^n $ is an unbounded open convex set that does not contain a translation of a convex cone with non-empty interior, then there exist $ f:G\to\R $ and a concave…

Classical Analysis and ODEs · Mathematics 2024-03-25 Václav Kryštof

This is a continuation of the paper 'Symmetry breaking and other phenomena in the optimization of eigenvalues for composite membranes' by S. Chanillo, D. Grieser, M. Imai, K. Kurata, and I. Ohnishi. Again, we consider the following…

Analysis of PDEs · Mathematics 2007-05-23 S. Chanillo , D. Grieser , K. Kurata

Let $G = \mathrm{SCl}_n(q)$ be a quasisimple classical group with $n$ large, and let $x_1, \dots, x_k \in G$ random, where $k \geq q^C$. We show that the diameter of the resulting Cayley graph is bounded by $q^2 n^{O(1)}$ with probability…

Group Theory · Mathematics 2021-11-18 Sean Eberhard , Urban Jezernik

The diagonal of a multivariate power series F is the univariate power series Diag(F) generated by the diagonal terms of F. Diagonals form an important class of power series; they occur frequently in number theory, theoretical physics and…

Symbolic Computation · Computer Science 2015-10-16 Alin Bostan , Louis Dumont , Bruno Salvy

A $(k,m)$-Furstenberg set is a subset $S \subset \mathbb{F}_q^n$ with the property that each $k$-dimensional subspace of $\mathbb{F}_q^n$ can be translated so that it intersects $S$ in at least $m$ points. Ellenberg and Erman proved that…

Combinatorics · Mathematics 2023-05-05 Manik Dhar , Zeev Dvir , Ben Lund

Let $\mathcal{F}_{n}^*$ be the set of Boolean functions depending on all $n$ variables. We prove that for any $f\in \mathcal{F}_{n}^*$, $f|_{x_i=0}$ or $f|_{x_i=1}$ depends on the remaining $n-1$ variables, for some variable $x_i$. This…

Computational Complexity · Computer Science 2015-02-05 Chia-Jung Lee , Satya V. Lokam , Shi-Chun Tsai , Ming-Chuan Yang