Related papers: Computing higher rank primitive root densities
We study the complexity of solving the \emph{generalized MinRank problem}, i.e. computing the set of points where the evaluation of a polynomial matrix has rank at most $r$. A natural algebraic representation of this problem gives rise to a…
For polynomials of degree two over finite fields, we present an improvement of Fitzgerald's characterization (Finite Fields Appl. 9(1):117-121, 2003). We then use this new characterization to obtain an explicit, complete, and simple…
We propose a modification of the predictions of the Cohen--Lenstra heuristic for class groups of number fields in the case where roots of unity are present in the base field. As evidence for this modified formula we provide a large set of…
We shall present an elementary approach to extremal decompositions of (quantum) covariance matrices determined by densities. We give a new proof on former results and provide a sharp estimate of the ranks of the densities that appear in the…
We present a version of the weighted cellular matrix-tree theorem that is suitable for calculating explicit generating functions for spanning trees of highly structured families of simplicial and cell complexes. We apply the result to give…
This note generalizes the Fibonacci primitive roots to the set of integers. An asymptotic formula for counting the number of integers with such primitive root is introduced here.
We describe a new algorithm for computing Whitney stratifications of complex projective varieties. The main ingredients are (a) an algebraic criterion, due to L\^e and Teissier, which reformulates Whitney regularity in terms of conormal…
In this article we undertake a study of extension complexity from the perspective of formal languages. We define a natural way to associate a family of polytopes with binary languages. This allows us to define the notion of extension…
Recently, D. Wang has devised a new contour integral based method to simplify certain matrix integrals. Capitalizing on that approach, we derive a new expression for the probability density function (p.d.f.) of the joint eigenvalues of a…
Linearity and ramification constraints have been widely used to weaken higher-order (primitive) recursion in such a way that the class of representable functions equals the class of polytime functions. We show that fine-tuning these two…
We completely classify Laurent series converging on the unit circle over a non-Archimedean local field (of any characteristic) that map infinitely many roots of unity to roots of unity. For a given Laurent series $f$ over a field of…
A rank is a notion in descriptive set theory that describes ranks such as the Cantor-Bendixson rank on the set of closed subsets of a Polish space, differentiability ranks on the set of differentiable functions in $C[0,1]$ such as the…
We consider the problem of existence and enumeration of primitive TSRs of order n over any finite field. Here we prove the existence of primitive TSRs of order two over finite fields of characteristic two and establish an equivalence…
We prove that characteristic equations of certain types of delay differential systems, under some mild conditions on their coefficients, can possess infinitely many complex roots.
Let $H\_0, ..., H\_n$ be $m \times m$ matrices with entries in $\QQ$ and Hankel structure, i.e. constant skew diagonals. We consider the linear Hankel matrix $H(\vecx)=H\_0+\X\_1H\_1+...+\X\_nH\_n$ and the problem of computing sample points…
We define a new congruence relation on the set of integers, leading to a group similar to the multiplicative group of integers modulo $n$. It makes use of a symmetry almost omnipresent in modular multiplications and halves the number of…
Selmer group for an Artin representation over totally real fields was studied by Greenberg and Vatsal. In this paper we study the Selmer groups for an Artin representation over a totally complex field. We establish an algebraic function of…
A well studied problem in algebraic complexity theory is the determination of the complexity of problems relying on evaluations of bilinear maps. One measure of the complexity of a bilinear map (or 3-tensor) is the optimal number of…
We give very flexible, concrete constructions of discrete and faithful epresentations of right-angled Artin groups into higher-rank Lie groups. Using the geometry of the associated symmetric spaces and the combinatorics of the groups, we…
When a randomness is introduced at the level of real matrix elements, depending on its particular realization, a pair of eigenvalues can appear as real or form a complex conjugate pair. We show that in the limit of large matrix size the…