Related papers: Computing degree and class degree

We introduce and study the concept of cyclicity degree of a finite group $G$. This quantity measures the probability of a random subgroup of $G$ to be cyclic. Explicit formulas are obtained for some particular classes of finite groups. An…

In this paper, we examine the general algorithm for class group computations, when we do not have a small defining polynomial for the number field. Based on a result of Biasse and Fieker, we simplify their algorithm, improve the complexity…

In mathematics curves are typically defined as the images of continuous real functions (parametrizations) defined on a closed interval. They can also be defined as connected one-dimensional compact subsets of points. For simple curves of…

It is proved that for any finite dimensional representation of a prime order group over the field of rational numbers, polynomial invariants of degree at most $3$ separate the orbits. A result providing an upper degree bound for separating…

The degree sequence of a graph is the sequence of the degrees of its vertices. If $\pi$ is a degree sequence of a graph $G$, then $G$ is a realization of $\pi$ and $G$ realizes $\pi$. Determining when a sequence of positive integers is…

Graph polynomials encode fundamental combinatorial invariants of graphs. Their computation is investigated using tree and path decomposition frameworks, with formal definitions of treewidth, k-trees, and pathwidth establishing the…

Fractional graph isomorphism is the linear relaxation of an integer programming formulation of graph isomorphism. It preserves some invariants of graphs, like degree sequences and equitable partitions, but it does not preserve others like…

We answer an open question in the theory of transducer degrees initially posed in [3], on the structure of polynomial transducer degrees, in particular the question of what degrees, if any, lie below the degree of $n^3$. Transducer degrees…

For a permutation $\pi$ in the symmetric group $S_n$ let the {\it total degree} be its valency in the Hasse diagram of the strong Bruhat order on $S_n$, and let the {\it down degree} be the number of permutations which are covered by $\pi$…

Let $p$ be a prime divisor of the order of a finite group $G$. Then $G$ has at least $2 \sqrt{p-1}$ complex irreducible characters of degrees prime to $p$. In case $p$ is a prime with $\sqrt{p-1}$ an integer this bound is sharp for…

We develop a support theory for elementary supergroup schemes, over a field of positive characteristic $p\ge 3$, starting with a definition of a $\pi$-point generalising cyclic shifted subgroups of Carlson for elementary abelian groups and…

In this paper, we apply the machinery developed in arXiv:2401.06641(2) to study the behavior of computable categoricity relativized to non-c.e. degrees. In particular, we show that we can build a computable structure which is not computably…

Invariance to geometric transformations is a highly desirable property of automatic classifiers in many image recognition tasks. Nevertheless, it is unclear to which extent state-of-the-art classifiers are invariant to basic transformations…

We completely describe a new domain for abstract interpretation of numerical programs. Fixpoint iteration in this domain is proved to converge to finite precise invariants for (at least) the class of stable linear recursive filters of any…

In this article, we generalize the arithmetic degree and its related theory to dynamical systems defined over an arbitrary field $\mathbf{k}$ of characteristic $0$. We first consider a dynamical system $(X,f)$ over a finitely generated…

As inductive inference and machine learning methods in computer science see continued success, researchers are aiming to describe ever more complex probabilistic models and inference algorithms. It is natural to ask whether there is a…

The module category of any artin algebra is filtered by the powers of its radical, thus defining an associated graded category. As an extension of the degree of irreducible morphisms, this text introduces the degree of morphisms in the…

Let $p$ be a prime. We study non-constant morphisms $f:X_0(p)_\mathbb \to Y$, where $Y/\mathbb Q$ is a curve of genus $\geq 2$. We prove that for $p<3000$ such an $f$ of degree $d>1$ must be isomorphic to the quotient map $X_0(p)\to…

We study the degree of irreducible morphisms in any Auslander-Reiten component of a finite dimensional algebra over an algebraically closed field. We give a characterization for an irreducible morphism to have finite left (or right) degree.…

We study finite-state transducers and their power for transforming infinite words. Infinite sequences of symbols are of paramount importance in a wide range of fields, from formal languages to pure mathematics and physics. While finite…