Related papers: Low-degree functions without non-essential argumen…

The concept of extension-based proofs models the idea of a valency argument, which is widely used in distributed computing. Extension-based proofs are limited in power: it has been shown that there is no extension-based proof of the…

In quantum mechanics some properties are maximally incompatible, such as the position and momentum of a particle or the vertical and horizontal projections of a 2-level spin. Given any definite state of one property the other property is…

For any link and for any modulus $m$ we introduce an equivalence relation on the set of non-trivial m-colorings of the link (an m-coloring has values in Z/mZ). Given a diagram of the link, the equivalence class of a non-trivial m-coloring…

We introduce analogues of the Hopf algebra of Free quasi-symmetric functions with bases labelled by colored permutations. As applications, we recover in a simple way the descent algebras associated with wreath products $\Gamma\wr\SG_n$ and…

Let $V$ be a finite set of size $n$. We consider real functions on the "slice" $\binom{V}{k}$, which are also known as functions in the Johnson scheme. For $I \subseteq J \subseteq V$, the characteristic function of the set of all…

Let $F$ be a quadratic APN function of $n$ variables. The associated Boolean function $\gamma_F$ in $2n$ variables ($\gamma_F(a,b)=1$ if $a\neq{\bf 0}$ and equation $F(x)+F(x+a)=b$ has solutions) has the form $\gamma_F(a,b) = \Phi_F(a)…

Let $\Delta,q\geq 3$ be integers. We prove that there exists $\eta\geq 0.002$ such that if $q\geq (2-\eta)\Delta$, then there exists an open set $\mathcal{U}\subset \mathbb{C}$ that contains the interval $[0,1]$ such that for each $w\in…

The concept and the construction of modular graph functions are generalized from genus-one to higher genus surfaces. The integrand of the four-graviton superstring amplitude at genus-two provides a generating function for a special class of…

We show that for $q$-colorings in $k$-uniform hypergraphs with maximum degree $\Delta$, if $k\ge 50$ and $q\ge 700\Delta^{\frac{5}{k-10}}$, there is a "Lee-Yang" zero-free strip around the interval $[0,1]$ of the partition function, which…

Using the technique developed in approximation theory, we construct examples of exponential families of infinitely divisible laws which can be viewed as deformations of the normal, gamma, and Poisson exponential families. Replacing the…

It follows from the work of Tait and the Four-Color-Theorem that a planar cubic graph is 3-edge-colorable if and only if it contains no bridge. We consider the question of which planar graphs are subgraphs of planar cubic bridgeless graphs,…

Graphs of solutions to the minimal surface equation over simply connected domains with boundary values 0 can have at most exponential growth.

We propose a new type of approximate counting algorithms for the problems of enumerating the number of independent sets and proper colorings in low degree graphs with large girth. Our algorithms are not based on a commonly used Markov chain…

We provide two sufficient and necessary conditions to characterize any $n$-bit partial Boolean function with exact quantum 1-query complexity. Using the first characterization, we present all $n$-bit partial Boolean functions that depend on…

In this paper we define a notion of partial APNness and find various characterizations and constructions of classes of functions satisfying this condition. We connect this notion to the known conjecture that APN functions modified at a…

For spin systems, such as the $q$-colorings and independent-set models, approximating the partition function in the so-called non-uniqueness region, where the model exhibits long-range correlations, is typically computationally hard for…

In the second part of this work was developed a technique of balayage of finite genus $q=0,1,2,\dots$ for measures (charges) and ($\delta$-) subharmonic functions of finite order to an arbitrary closed system of rays $S$ with vertex at…

We study the problem of constructing a (near) random proper $q$-colouring of a simple k-uniform hypergraph with n vertices and maximum degree \Delta. (Proper in that no edge is mono-coloured and simple in that two edges have maximum…

Let $F$ be the field of $q$ elements. We investigate the following Ramsey coloring problem for vector spaces: Given a vector space $\F^n$, give a coloring of the points of $F^n$ with two colors such that no affine line (i.e., affine…

We prove that every entire solution of the minimal graph equation that is bounded from below and has at most linear growth must be constant on a complete Riemannian manifold $M$ with only one end if $M$ has asymptotically non-negative…