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

As a fundamental metric for quantifying quantum advantage in non-local games, the quantum chromatic number reveals the power of entanglement in distributed tasks. In this paper, we investigate this parameter for $q$-ary Hamming graphs and a…

We introduce one- and two-dimensional `exponential shapelets': orthonormal basis functions that efficiently model isolated features in data. They are built from eigenfunctions of the quantum mechanical hydrogen atom, and inherit mathematics…

We present a deformed algebra related to the q-exponential and the q-logarithm functions that emerge from nonextensive statistical mechanics. We also develop a q-derivative (and consistently a q-integral) for which the q-exponential is an…

Degree-based graph construction is an ubiquitous problem in network modeling, ranging from social sciences to chemical compounds and biochemical reaction networks in the cell. This problem includes existence, enumeration, exhaustive…

We discuss representations and colorings of orthogonality hypergraphs in terms of their two-valued states interpretable as classical truth assignments. Such hypergraphs, if they allow for a faithful orthogonal representation, have quantum…

An anagram is a word of the form $WP$ where $W$ is a non-empty word and $P$ is a permutation of $W$. We study anagram-free graph colouring and give bounds on the chromatic number. Alon et al. (2002) asked whether anagram-free chromatic…

Let $\mathcal{C}$ be a proper minor-closed class of graphs. Given the minors excluded in $\mathcal{C}$, we determine the maximum $q$-centered chromatic number and the maximum $q$th weak coloring number of graphs in $\mathcal{C}$ within an…

Asymptotic expansions of Gaussian integrals may often be interpreted as generating functions for certain combinatorial objects (graphs with additional data). In this article we discuss a general approach to all such cases using colored…

We use directed graphs called "syzygy quivers" to study the asymptotic growth rates of the dimensions of the syzygies of representations of finite dimensional algebras. For any finitely generated representation of a monomial algebra, we…

Several recent works have demonstrated the powerful algebraic simplifications that can be achieved for scattering amplitudes through a systematic grading of transcendental quantities. We develop these concepts to construct a minimal basis…

We prove a necessary condition for some polynomials of Kasami degree to be APN over F_{q^n} for large n.

In this article, we study algebraic decompositions and secondary constructions of almost perfect nonlinear (APN) functions. In many cases, we establish precise criteria which characterize when certain modifications of a given APN function…

For any prime number p and any positive real number {\alpha}, we construct a finitely generated group {\Gamma} with p-gradient equal to {\alpha}. This construction is used to show that there exist uncountably many pairwise non-commensurable…

It is proved that 1) the indicator function of some onefold or multifold independent set in a regular graph is a perfect coloring if and only if the set attain the Delsarte--Hoffman bound; 2) each transversal in a uniform regular hypergraph…

In this work we prove that certain entire $q$-functions have infinitely many nonzero roots $\left\{ \rho_{n}\right\} _{n=1}^{\infty}$, as $n\to+\infty$ the moduli $\left|\rho_{n}\right|$ grow at least exponentially. Applications to entire…

Parameter testing algorithms are using constant number of queries to estimate the value of a certain parameter of a very large finite graph. It is well-known that graph parameters such as the independence ratio or the edit-distance from…

Based on the concept of positive definite functions on finite groups, we present a new necessary condition for the existence of Butson Hadamard matrices $BH(n,q)$. We use this condition to prove some nonexistence results for a sequence of…

Hadwiger's Conjecture asserts that every $K_t$-minor-free graph has a proper $(t-1)$-colouring. We relax the conclusion in Hadwiger's Conjecture via improper colourings. We prove that every $K_t$-minor-free graph is $(2t-2)$-colourable with…

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

Erd\H{o}s and Hajnal constructed a 4-coloring of the triples of an $N$-element set such that every $n$-element subset contains 2 triples with distinct colors, and $N$ is double exponential in $n$. Conlon, Fox and R\"odl asked whether there…