Related papers: A Graph Theoretic Method for Determining Generatin…

Let $\mathbb{F}_{q}$ be a finite field of characteristic $2$ and $O_2^+(\mathbb{F}_{q})$ be the $2$-dimensional orthogonal group of plus type over $\mathbb{F}_{q}$. Consider the standard representation $V$ of $O_2^+(\mathbb{F}_{q})$ and the…

This thesis provides a partial answer to a question posed by Greg Kuperberg in q-alg/9712003 and again by Justin Roberts as problem 12.18 in "Problems on invariants of knots and 3-manifolds", math.GT/0406190, essentially: "Can one describe…

Although degree bounds and algorithms for the generators of various invariant rings have been known for decades, little is known about the cardinality of minimal generating sets. Estimates of such would provide lower bounds for the runtime…

In this article we associate to every lattice ideal $I_{L,\rho}\subset K[x_1,..., x_m]$ a cone $\sigma $ and a graph $G_{\sigma}$ with vertices the minimal generators of the Stanley-Reisner ideal of $\sigma $. To every polynomial $F$ we…

We give a quantum algorithm for a novel type of black-box problem: identifying a hidden $d$-regular base graph $G$ on $n$ vertices from oracle access to an obfuscated version of it, rather than traversing it. From $G$ we build the spired…

Quantum circuits composed of CNOT and $R_z$ are fundamental building blocks of many quantum algorithms, so optimizing the synthesis of such quantum circuits is crucial. We address this problem from a theoretical perspective by studying the…

It is shown that every Leavitt path algebra L of an arbitrary directed graph E over a field K is an arithmetical ring, that is, the two-sided ideals of L form a distributive lattice. It is also shown that L is a multiplication ring, that…

Associated to a finite graph $X$ is its quantum automorphism group $G$. The main problem is to compute the Poincar\'e series of $G$, meaning the series $f(z)=1+c_1z+c_2z^2+...$ whose coefficients are multiplicities of 1 into tensor powers…

We study the topology of the prime spectrum of an algebra supporting a rational torus action. More precisely, we study inclusions between prime ideals that are torus-invariant using the $H$-stratification theory of Goodearl and Letzter on…

Using periodic-orbit theory beyond the diagonal approximation we investigate the form factor, $K(\tau)$, of a generic quantum graph with mixing classical dynamics and time-reversal symmetry. We calculate the contribution from pairs of…

Given an arbitrary graph E and a field K, the prime ideals as well as the primitive ideals of the Leavitt path algebra L_K(E) are completely described in terms of their generators. The stratification of the prime spectrum of L_K(E) is…

A quantum graph $\mathcal{G}$ housed by a matrix algebra $M_n$ can be encoded as an operator system $\mathcal S=\mathcal{S}_{\mathcal{G}}\le M_n$. There are two sensible notions of quantum automorphism group for any such:…

A set of vertices $S$ is a \emph{determining set} of a graph $G$ if every automorphism of $G$ is uniquely determined by its action on $S$. The \emph{determining number} of $G$ is the minimum cardinality of a determining set of $G$. This…

If X is an n-element set, we call a family G of subsets of X a k-generator for X if every subset of X can be expressed as a union of at most k disjoint sets in G. Frein, Leveque and Sebo conjectured that for n > 2k, the smallest…

We define in this paper a class of three indices tensor models, endowed with $O(N)^{\otimes 3}$ invariance ($N$ being the size of the tensor). This allows to generate, via the usual QFT perturbative expansion, a class of Feynman tensor…

It is known that for a monomial ideal $I$, the number of minimal generators, $\mu(I^n)$, eventually follows a polynomial pattern for increasing $n$. In general, little is known about the power at which this pattern emerges. Even less is…

The $q$-Onsager algebra, denoted by $O_q$, is defined by generators $W_0, W_1$ and two relations called the $q$-Dolan-Grady relations. In 2017, Baseilhac and Kolb gave some elements of $O_q$ that form a Poincar\'e-Birkhoff-Witt basis. The…

Let $H$ be a fixed $k$-vertex graph with $m$ edges and minimum degree $d >0$. We use the learning graph framework of Belovs to show that the bounded-error quantum query complexity of determining if an $n$-vertex graph contains $H$ as a…

In this paper we study the algebra of graph invariants, focusing mainly on the invariants of simple graphs. All other invariants, such as sorted eigenvalues, degree sequences and canonical permutations, belong to this algebra. In fact,…

We give a general construction leading to different non-isomorphic families $\Gamma_{n,q}(\K)$ of connected $q$-regular semisymmetric graphs of order $2q^{n+1}$ embedded in $\PG(n+1,q)$, for a prime power $q=p^h$, using the linear…