Related papers: A Graph Theoretic Method for Determining Generatin…
We compute the primary decomposition of certain ideals generated by subsets of minors in a generic matrix or in a generic symmetric matrix, or subsets of Pfaffians in a generic skew-symmetric matrix. Specifically, the ideals we consider are…
We consider the problem of finding small prime gaps in various sets of integers $\mathcal{C}$. Following the work of Goldston-Pintz-Yildirim, we will consider collections of natural numbers that are well-controlled in arithmetic…
We obtain tight bounds for the minimal number of generators of an ideal with bounded-degree generators in a polynomial ring $K[X_1,\dots,X_n],$ as well as a sharp quantification of the maximum possible size of a minimal generating set of…
Denote the set of algebraic numbers as $\overline{\mathbb{Q}}$ and the set of algebraic integers as $\overline{\mathbb{Z}}$. For $\gamma\in\overline{\mathbb{Q}}$, consider its irreducible polynomial in $\mathbb{Z}[x]$,…
We introduce a simple diagrammatic approach for estimating how a randomly walking quantum particle searches on a graph in continuous-time, which involves sketching small weighted graphs with self-loops and considering degenerate…
Let $I \subseteq R = \mathbb{K}[x_1,\ldots,x_n]$ be a toric ideal, i.e., a binomial prime ideal. We investigate when the ideal $I$ can be "split" into the sum of two smaller toric ideals. For a general toric ideal $I$, we give a sufficient…
The article targets binomial ideals in quantum tori and quantum affine spaces. First, noncommutative analogs of known results for commutative (Laurent) polynomial rings are obtained, including the following: Under the assumption of an…
In this article, we study binomial ideals generated by an arbitrary collection of corner-interval $2$-minors of a generic matrix. We determine the minimal prime ideals of such ideals and characterize their radicality in the special case of…
The edges of any hypergraph parametrize a monomial algebra called the edge subring of the hypergraph. We study presentation ideals of these edge subrings, and describe their generators in terms of balanced walks on hypergraphs. Our results…
We study the problem of Minimum $k$-Critical Bipartite Graph of order $(n,m)$ - M$k$CBG-$(n,m)$: to find a bipartite $G=(U,V;E)$, with $|U|=n$, $|V|=m$, and $n>m>1$, which is $k$-critical bipartite, and the tuple $(|E|, \Delta_U,…
Describing minimal generating sets of toric ideals is a well-studied and difficult problem. Neil White conjectured in 1980 that the toric ideal associated to a matroid is generated by quadrics corresponding to single element symmetric…
A graph of order $n$ is said to be $k$-\emph{factor-critical} $(0\le k<n)$ if the removal of any $k$ vertices results in a graph with a perfect matching. A $k$-factor-critical graph $G$ is \emph{minimal} if $G-e$ is not $k$-factor-critical…
In this paper, we study a class of toric ideals obtained by using some geometric data of ADE trees which are the minimal resolution graphs of rational surface singularities. We compute explicit Gr\"obner bases for these toric ideals that…
Matrix $M$ is {\em $k$-concise} if the finite entries of each column of $M$ consist of $k$ or less intervals of identical numbers. We give an $O(n+m)$-time algorithm to compute the row minima of any $O(1)$-concise $n\times m$ matrix. Our…
Associated to any closed subgroup $G\subset U_N^+$ is a family of toral subgroups $T_Q\subset G$, indexed by the unitary matrices $Q\in U_N$. The family $\{T_Q|Q\in U_N\}$ is expected to encode the main properties of $G$, and there are…
Quantum graphs are defined by having a Laplacian defined on the edges of a metric graph with boundary conditions on each vertex such that the resulting operator, $\mathbf{L}$, is self-adjoint. We use Neumann boundary conditions although we…
This paper has two aims. The first is to study ideals of minors of matrices whose entries are among the variables of a polynomial ring. Specifically, we describe matrices whose ideals of minors of a given size are prime. The main result in…
We consider random quantum circuits (RQC) on arbitrary connected graphs whose edges determine the allowed $2$-qudit interactions. Prior work has established that such $n$-qudit circuits with local dimension $q$ on 1D, complete, and…
The First Fundamental Theorem of Invariant Theory describes a minimal generating set of the invariant polynomial ring under the action of some group $G$. In this note we give an elementary and direct proof for the $\operatorname{GL}_2(K)$…
Motivated by the vast literature of quantum automorphism groups of graphs, we define and study quantum automorphism groups of matroids. A key feature of quantum groups is that there are many quantizations of a classical group, and this…