Related papers: Computing degree and class degree
We discuss several enumerative results for irreducible polynomials of a given degree and pairs of relatively prime polynomials of given degrees in several variables over finite fields. Two notions of degree, the {\em total degree} and the…
We compute the degree of Stiefel manifolds, that is, the variety of orthonormal frames in a finite dimensional vector space. Our approach employs techniques from classical algebraic geometry, algebraic combinatorics, and classical invariant…
Resolvent degree is an invariant measuring the complexity of algebraic and geometric phenomena, including the complexity of finite groups. To date, the resolvent degree of a finite simple group $G$ has only been investigated when $G$ is a…
Recently, sub-indices and sub-factors of groups with connections to number theory, additive combinatorics, and factorization of groups have been introduced and studied. Since all group subsets are considered in the theory and there are many…
The power graph of a given finite group is a simple undirected graph whose vertex set is the group itself, and there is an edge between any two distinct vertices if one is a power of the other. In this paper, we find a precise formula to…
Scores based on Shapley values are widely used for providing explanations to classification results over machine learning models. A prime example of this is the influential SHAP-score, a version of the Shapley value that can help explain…
Working over a ground field of characteristic zero, this paper studies the quotient morphism $\pi :X\to Y$ for an affine $\mathbb{G}_a$-variety $X$ with affine quotient $Y$. It is shown that the degree modules associated to the…
The endeavor to preserve the generalization of a fair and invariant classifier across domains, especially in the presence of distribution shifts, becomes a significant and intricate challenge in machine learning. In response to this…
We give an explicit upper bound for the number of equivalence classes of binary forms with rational integral coefficients of given degree and given discriminant, and with given splitting field. Further, we give an explicit upper bound for…
Given a factor code between sofic shifts X and Y, there is a family of decompositions of the original code into factor codes such that the entropies of the intermediate subshifts arising from the decompositions are dense in the interval…
The classical Severi degree counts the number of algebraic curves of fixed genus and class passing through points in a surface. We express the Severi degrees of CP1 x CP1 as matrix elements of the exponential of a single operator M on Fock…
Adapting a result of Bazhenov, Kalimullin, and Yamaleev, we show that if a Turing degree $\textbf{d}$ is the degree of categoricity of a computable structure $\mathcal{M}$ and is not the strong degree of categoricity of any computable…
Generic computability has been studied in group theory and we now study it in the context of classical computability theory. A set A of natural numbers is generically computable if there is a partial computable function f whose domain has…
Let $\pi$ be a factor map from a one-dimensional mixing shift of finite type $X$ onto a sofic shift $Y$. We investigate when $\pi$ sends Gibbs measures on $X$ to non-Gibbs measures on $Y$.
This article is the first in a series devoted to computing the class groups of real quadratic fields. We present a new relation between the class number and the index of unit groups. This relation generalizes Hilbert class field theory for…
The aim of this paper is to show that there exists a deterministic algorithm that can be applied to compute the factors of a polynomial of degree 2, defined over a finite field, given certain conditions.
Given a grading by an abelian group G on a semisimple Lie algebra L over an algebraically closed field of characteristic 0, we classify up to isomorphism the simple objects in the category of finite-dimensional G-graded L-modules. The…
In Machine Learning, the $\mathsf{SHAP}$-score is a version of the Shapley value that is used to explain the result of a learned model on a specific entity by assigning a score to every feature. While in general computing Shapley values is…
We generalize the differential dimension polynomial from prime differential ideals to characterizable differential ideals. Its computation is algorithmic, its degree and leading coefficient remain differential birational invariants, and it…
General factors are a generalization of matchings. Given a graph $G$ with a set $\pi(v)$ of feasible degrees, called a degree constraint, for each vertex $v$ of $G$, the general factor problem is to find a (spanning) subgraph $F$ of $G$…