Related papers: Cohen Lenstra Partitions and Mutually Annihilating…
Efficient methods for computing with matrices over finite fields often involve randomised algorithms, where matrices with a certain property are sought via repeated random selection. Complexity analyses for these algorithms require…
In the context of phase-space quantization, matrix elements and observables result from integration of c-number functions over phase space, with Wigner functions serving as the quasi-probability measure. The complete sets of Wigner…
In this paper we prove an identity in terms of generating functions which enables us to calculate the numbers of isomorphism classes of absolutely indecomposable semistable representations of quivers over finite fields.
We develop a method to construct elusive functions using techniques of commutative algebra and algebraic geometry. The key notions of this method are elusive subsets and evaluation mappings. We also develop the effective elimination theory…
In this talk I describe some applications of random matrix models to the study of N=1 supersymmetric Yang-Mills theories with matter fields in the fundamental representation. I review the derivation of the…
Motivated by recent works on statistics of matrices over sets of number theoretic interest, we study matrices with entries from arbitrary finite subsets $\mathcal A$ of finite rank multiplicative groups infields of characteristic zero. We…
In this paper we study the equations of the elimination ideal associated with $n+1$ generic multihomogeneous polynomials defined over a product of projective spaces of dimension $n$. We first prove a duality property and then make this…
We determine the rank of a random matrix A over a finite field with prescribed numbers of non-zero entries in each row and column. As an application we obtain a formula for the rate of low-density parity check codes. This formula verifies a…
We develop methods for computing with matrix groups defined over a range of infinite domains, and apply those methods to the design of algorithms for nilpotent groups. In particular, we provide a practical algorithm to test nilpotency of…
Cohen-Lenstra heuristics for Jacobians of random graphs give rise to random partitions. We connect these random partitions to the Hall-Littlewood polynomials of symmetric function theory, and use this connection to give combinatorial proofs…
Various branches of matrix model partition function can be represented as intertwined products of universal elementary constituents: Gaussian partition functions Z_G and Kontsevich tau-functions Z_K. In physical terms, this decomposition is…
Given any polynomial $p$ in $C[X]$, we show that the set of irreducible matrices satisfying $p(A)=0$ is finite. In the specific case $p(X)=X^2-nX$, we count the number of irreducible matrices in this set and analyze the arising sequences…
We introduce an appropriate formalism in order to study conformal Killing (symmetric) tensors on Riemannian manifolds. We reprove in a simple way some known results in the field and obtain several new results, like the classification of…
Many questions in number theory concern the nonvanishing of determinants of square matrices of logarithms (complex or p-adic) of algebraic numbers. We present a new conjecture that states that if such a matrix has vanishing determinant,…
We construct an Imbimbo-Mukhi type matrix model, which reproduces exactly the partition function of ${\mathbb{CP}^1}$ topological strings in the small phase space, Nekrasov's instanton counting in ${\cal{N}}=2$ gauge theory and the large…
We explore the situation where all companion $n \times n$ matrices over a field $F$ are weakly periodic of index of nilpotence $2$ and prove that this can be happen uniquely when $F$ is a countable field of positive characteristic, which is…
We classify fields having finitely many finite non-commutative (not necessarily central) division algebras over them. In the process, we introduce the notion of anti-closure of a field and also make comments on fields having a linear…
We study various combinatorial properties, and the implications between them, for filters generated by infinite-dimensional subspaces of a countable vector space. These properties are analogous to selectivity for ultrafilters on the natural…
Methods are presented for finding Killing-Yano tensors, conformal Killing-Yano tensors, and conformal Killing vectors in spacetimes with a hypersurface orthogonal Killing vector. These methods are similar to a method developed by the…
The purpose of this paper is twofold. First, we define the new spaces and investigate some topological and structural properties. Also, we compute dual spaces of new spaces which are help us in the characterization of matrix mappings.…