相关论文: Towards a CFSG-free diameter bound for $\mathrm{Al…

We give a polynomial-time algorithm that finds a planted clique of size $k \ge \sqrt{n \log n}$ in the semirandom model, improving the state-of-the-art $\sqrt{n} (\log n)^2$ bound. This $\textit{semirandom planted clique problem}$ concerns…

We present a simple performance bound for the greedy scheme in string optimization problems that obtains strong results. Our approach vastly generalizes the group of previously established greedy curvature bounds by Conforti and…

The sum of square roots is as follows: Given $x_1,\dots,x_n \in \mathbb{Z}$ and $a_1,\dots,a_n \in \mathbb{N}$ decide whether $ E=\sum_{i=1}^n x_i \sqrt{a_i} \geq 0$. It is a prominent open problem (Problem 33 of the Open Problems Project),…

The breakthrough paper of Croot, Lev, Pach \cite{CLP} on progression-free sets in $\Z_4^n$ introduced a polynomial method that has generated a wealth of applications, such as Ellenberg and Gijswijt's solutions to the cap set problem…

We prove that we have an isomorphism of type $A_{aut}(\mathbb C_\sigma[G])\simeq A_{aut}(\mathbb C[G])^\sigma$, for any finite group $G$, and any 2-cocycle $\sigma$ on $G$. In the particular case $G=\mathbb Z_n^2$, this leads to a…

Resolution over linear equations is a natural extension of the popular resolution refutation system, augmented with the ability to carry out basic counting. Denoted Res(lin_R), this refutation system operates with disjunctions of linear…

We present an algorithm that computes the diameter of random geometric graphs (RGGs) with expected average degree ${\Theta}(n^{\delta})$ for constant ${\delta}\in(0,1)$ in $\tilde{O}(n^{\frac{3}{2}(1+{\delta})} +n^{2 -…

Motivated by recent connections to factorised databases, we analyse the efficiency of representations by context free grammars (CFGs). Concretely, we prove a recent conjecture by Kimelfeld, Martens, and Niewerth (ICDT 2025), that for finite…

It has been known for almost three decades that many $\mathrm{NP}$-hard optimization problems can be solved in polynomial time when restricted to structures of constant treewidth. In this work we provide the first extension of such results…

Motivated by applications to matrix multiplication algorithms, Pratt asked (ITCS'24) how large a subset of $[n] \times [n]$ could be without containing a skew-corner: three points $(x,y), (x,y+h),(x+h,y')$ with $h \ne 0$. We prove any skew…

We prove the existence of an upper bound on the asymptotic dimension of tree amalgamations of locally finite quasi-transitive connected graphs. This generalises a result of Dranishnikov for free products with amalgamation and a result of…

An algorithmic upper bound on the domination number $\gamma$ of graphs in terms of the order $n$ and the minimum degree $\delta$ is proved. It is demonstrated that the bound improves best previous bounds for any $5\le \delta \le 50$. In…

In this paper, we derive new, nearly optimal bounds for the Gaussian approximation to scaled averages of $n$ independent high-dimensional centered random vectors $X_1,\dots,X_n$ over the class of rectangles in the case when the covariance…

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. All lower bounds so far have made strong restrictions on the computational model.…

For each $n$, let RD$(n)$ denote the minimum $d$ for which there exists a formula for the general polynomial of degree $n$ in algebraic functions of at most $d$ variables. In this paper, we recover an algorithm of Sylvester for determining…

The arithmetic regularity lemma due to Green [GAFA 2005] is an analogue of the famous Szemer{\'e}di regularity lemma in graph theory. It shows that for any abelian group $G$ and any bounded function $f:G \to [0,1]$, there exists a subgroup…

Alon, Shpilka and Umans considered the following version of usual sunflower-free subset: a subset $\mbox{$\cal F$}\subseteq \{1,\ldots ,D\}^n$ for $D>2$ is sunflower-free if for every distinct triple $x,y,z\in \mbox{$\cal F$}$ there exists…

A set A is square-difference free (henceforth SDF) if there do not exist x,y\in A, x\ne y, such that |x-y| is a square. Let sdf(n) be the size of the largest SDF subset of {1,...,n}. Ruzsa has shown that sdf(n) = \Omega(n^{0.5(1+ \log_{65}…

We extend Babai's quasipolynomial-time graph isomorphism test (STOC 2016) and develop a quasipolynomial-time algorithm for the multiple-coset isomorphism problem. The algorithm for the multiple-coset isomorphism problem allows to exploit…

Gaudin algebra is the commutative subalgebra in $U(\mathfrak{g})^{\otimes N}$ generated by higher integrals of the quantum Gaudin magnet chain attached to a semisimple Lie algebra $\mathfrak{g}$. This algebra depends on a collection of…