Related papers: Algorithmic Polynomial Freiman-Ruzsa Theorems

Fulling, King, Wybourne and Cummings (FKWC) have proposed to expand systematically the Riemann polynomials encountered in the context of field theories in curved spacetime on standard bases constructed from group theoretical considerations.…

We describe a technique for mechanically proving certain kinds of theorems in combinatorics on words, using automata and a package for manipulating them. We illustrate our technique by solving, purely mechanically, an open problem of Currie…

Two-point Feynman parameter integrals, with at most one mass and containing local operator insertions in $4+\ep$-dimensional Minkowski space, can be transformed to multi-integrals or multi-sums over hyperexponential and/or hypergeometric…

After revisiting Cantor-Zassenhaus polynomial factorization algorithm, we describe a new simplified version of it, which requires less computational cost. Moreover we show that it is able to find a factor of a fully splitting polynomial of…

We study criteria for a ring - or more generally, for a small category - to be Gorenstein and for a module over it to be of finite projective dimension. The goal is to unify the universal coefficient theorems found in the literature and to…

For a $\{0,1\}$-valued matrix $M$ let $\rm{CC}(M)$ denote the deterministic communication complexity of the boolean function associated with $M$. The log-rank conjecture of Lov\'{a}sz and Saks [FOCS 1988] states that $\rm{CC}(M) \leq…

Let K be an algebraic number field of degree d and discriminant D over Q. Let A be an associative algebra over K given by structure constants such that A is isomorphic to the algebra M_n(K) of n by n matrices over K for some positive…

We explicate the combinatorial/geometric ingredients of Arthur's proof of the convergence and polynomiality, in a truncation parameter, of his non-invariant trace formula. Starting with a fan in a real, finite dimensional, vector space and…

Global problems associated with the transformation from the Arnowitt, Deser and Misner (ADM) to the Kucha\v{r} variables are studied. Two models are considered: The Friedmann cosmology with scalar matter and the torus sector of the 2+1…

We study the problem of factoring univariate polynomials over finite fields. Under the assumption of the Extended Riemann Hypothesis (ERH), (Gao, 2001) designed a polynomial time algorithm that fails to factor only if the input polynomial…

We extend Gegenbauer Polynomials technique to evaluate a class of complicated Feynman diagrams. New results in the form of $_3F_2$-hypergeometrical series of unit argument, are presented. As a by-product, we present a new transformation…

We suggest a categorification procedure for the SO(2N) one-variable specialization of the two-variable Kauffman polynomial. The construction has many similarities with the HOMFLYPT categorification: a planar graph formula for the polynomial…

We establish the first general connection between the design of quantum algorithms and circuit lower bounds. Specifically, let $\mathfrak{C}$ be a class of polynomial-size concepts, and suppose that $\mathfrak{C}$ can be PAC-learned with…

We extend the Ax-Katz theorem for a single polynomial from finite fields to the rings Z_m with m composite. This extension not only yields the analogous result, but gives significantly higher divisibility bounds. We conjecture what computer…

We introduce families of two-parameter multivariate polynomials indexed by pairs of partitions $v,w$ -- biaxial double $(\beta,q)$-Grothendieck polynomials -- which specialize at $q=0$ and $v=1$ to double $\beta$-Grothendieck polynomials…

This paper deals with simultaneously fast and in-place algorithms for formulae where the result has to be linearly accumulated: some output variables are also input variables, linked by a linear dependency. Fundamental examples include the…

Given a quiver associated to a cluster algebra and a sequence of vertices, iterative mutation leads to $F$-Polynomials which appear in numerous places in the cluster algebraic literature. The coefficients of the monomials in these…

This paper generalizes both the binary Deutsch-Jozsa and Grover algorithms to $n$-valued logic using the quantum Fourier transform. Our extended Deutsch-Jozsa algorithm is not only able to distinguish between constant and balanced Boolean…

We prove the following generalisation of Bohr theorem : let $K\subset\mathbb C$ a continuum, $(F_n)_n$ its Faber polynomials, $\Omega_R=\{\Phi_K<R\}, (R>1)$ the levels sets of the Green function; then there exists $R_0>1$ such that for any…

The paper contains a combinatorial theorem (the sequence of Newton polygons of a reccurent sequence of polynomials is quasi-linear) and two applications of it in classical and quantum topology, namely in the behavior of the $A$-polynomial…