Related papers: How symmetric is too symmetric for large quantum s…
We study the balance of $G$-gain graphs, where $G$ is an arbitrary group, by investigating their adjacency matrices and their spectra. As a first step, we characterize switching equivalence and balance of gain graphs in terms of their…
The recent theory of graph limits gives a powerful framework for understanding the properties of suitable (convergent) sequences $(G_n)$ of graphs in terms of a limiting object which may be represented by a symmetric function $W$ on…
Grover's quantum search algorithm can be formulated as a quantum particle randomly walking on the (highly symmetric) complete graph, with one vertex marked by a nonzero potential. From an initial equal superposition, the state evolves in a…
A classical result of Artin states that the ideal generated by symmetric polynomials in $n$ variables is of codimension $n!$. The author, F. Bergeron and N. Bergeron have recently obtained a surprising analogous in the case of…
We prove a neat factorization property of Feynman graphs in covariant perturbation theory. The contribution of the graph to the effective action is written as a product of a massless scalar momentum integral that only depends on the basic…
The fastest quantum algorithms (for the solution of classical computational tasks) known so far are basically variations of the hidden subgroup problem with {$f(U[x])=f(x)$}. Following a discussion regarding which tasks might be solved…
We introduce a new tool for quantum algorithms called quantum fast-forwarding (QFF). The tool uses quantum walks as a means to quadratically fast-forward a reversible Markov chain. More specifically, with $P$ the Markov chain transition…
For a number field K with absolute Galois group G_K, we consider the action of G_K on the infinite tree of preimages of a point in K under a degree-two rational function phi, with particular attention to the case when phi commutes with a…
We study the shape of the F-signature function of a $d$-dimensional quotient singularity $\mathbb{k}[[ x_1,\ldots,x_d]]^G$, and we show that it is a quasi-polynomial. We prove that the second coefficient is always zero and we describe the…
Let $G_k$ be a connected reductive algebraic group over an algebraically closed field $k$ of characteristic $\neq 2$. Let $K_k \subset G_k$ be a quasi-split symmetric subgroup of $G_k$ with respect to an involution $\theta_k$ of $G_k$. The…
According to the Gottesman-Knill theorem, any quantum algorithm utilising operations chosen exclusively from a particular restricted set are efficiently simulable by a classical computer. Since some of these algorithms involve entangled…
This is a chapter in a forthcoming book on completely regular codes in distance regular graphs. The chapter provides an overview, and some original results, on codes in distance regular graphs which admit symmetries via a permutation group…
We consider the following situation: G is a finite directed graph, where to each vertex of G is assigned an element of a finite group Gamma. We consider all walks of length N on G, starting from v_i and ending at v_j To each such walk $w$…
The Hidden Subgroup Problem is used in many quantum algorithms such as Simon's algorithm and Shor's factoring and discrete log algorithms. A polynomial time solution is known in case of abelian groups, and normal subgroups of arbitrary…
A Boolean function is symmetric if it is invariant under all permutations of its arguments; it is quasi-symmetric if it is symmetric with respect to the arguments on which it actually depends. We present a test that accepts every…
Motivated by the role of triadic closures in social networks, and the importance of finding a maximum subgraph avoiding a fixed pattern, we introduce and initiate the parameterized study of the Strong F-closure problem, where F is a fixed…
The goal is to extend a non-standard amenability test for groups, based on random walks and superharmonic functions, to group actions on sets, and to apply it to Thompson's group F using certain properties of extensive amenability. While no…
An important problem in the field of graph signal processing is developing appropriate overcomplete dictionaries for signals defined on different families of graphs. The Cayley graph of the symmetric group has natural applications in ranked…
The graph isomorphism problem asks whether two graphs are identical up to vertex relabeling. While the exact problem admits quasi-polynomial-time classical algorithms, many applications in molecular comparison, noisy network analysis, and…
Let $M$ be a closed, connected, orientable topological four-manifold with $H_1(M)$ nontrivial and free abelian, $b_2(M)\ne 0, 2$, and $\chi(M)\ne 0$. We show that if $G$ is a finite group of 2-rank $\le 1$ which admits a homologically…