Related papers: Enumerating Extensions of $(\pi)$-Adic Fields with…
Let $K$ be a local field whose residue field has characteristic $p$ and let $L/K$ be a finite separable totally ramified extension of degree $n=up^{\nu}$. Let $\sigma_1,\dots,\sigma_n$ denote the $K$-embeddings of $L$ into a separable…
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 investigate the interplay between invariant varieties of vector fields and the inflection locus of linear systems with respect to the vector field. Among the consequences of such investigation we obtain a computational criteria for the…
We study a new connection between multidimensional continued fractions, such as Jacobi--Perron algorithm, and additively indecomposable integers in totally real cubic number fields. First, we find the indecomposables of all signatures in…
We discuss criteria for the nonexistence, existence and computation of invariant algebraic surfaces for three-dimensional complex polynomial vector fields, thus transferring a classical problem of Poincar\'e from dimension two to dimension…
This paper describes a novel method to approximate the polynomial coefficients of regression functions, with particular interest on multi-dimensional classification. The derivation is simple, and offers a fast, robust classification…
We establish closed-form expansions for the universal edge elimination polynomial of paths and cycles and their generating functions. This includes closed-form expansions for the bivariate matching polynomial, the bivariate chromatic…
In this paper, a randomized algorithm for deciding the irreducibility of an irreducible polynomial and factoring a reducible polynomial over the field of rational numbers is presented. The main idea underlying the algorithm is based on…
In this note we compare the a-invariant of a homogeneous algebra B to the a-invariant of a subalgebra A. In particular we show that if $A \subset B$ is a finite homogeneous inclusion of standard graded domains over an algebraically closed…
We introduce a new matroid (graph) invariant, the arboricity polynomial. Given a matroid, the arboricity polynomial enumerates the number of covers of the ground set by disjoint independent sets. We establish the polynomiality of the…
In different areas of discrete mathematics, a certain type of polynomials, having coefficients in a field K of finite characteristic, has been considered. The form and the degree of these polynomials, here called projective, are simply…
We study how the field of definition of a rational function changes under iteration. We provide a complete classification of polynomials with the property that the field of definition of one of their iterates drops in degree (over a given…
For an abelian variety $A$ over a number field we study bounds depending only on the dimension of $A$ for the minimal degree $d(A)$ of a field extension over which $A$ acquires semi-stable reduction. We first compute $d(A)$ in terms of the…
A formula for calculating Extensions of (mainly integral) Polynomial Functors is established, based upon projective resolutions. Sample computations are performed, which, in particular, exhibit a surprising non-trivial extension of Divided…
Each graph and choice of a commutative ring gives rise to an associated graphical group. In this article, we introduce and investigate graph polynomials that enumerate conjugacy classes of graphical groups over finite fields according to…
We give formulas for the number of polynomials over a finite field with given root multiplicities, in particular in cases when the formula is surprisingly simple (a power of q). Besides this concrete interpretation, we also prove an…
We generate ring class fields of imaginary quadratic fields in terms of the special values of certain eta-quotients, which are related to the relative norms of Siegel-Ramachandra invariants. These give us minimal polynomials with relatively…
Motivated by the definition of the edge elimination polynomial of a graph we define the covered components polynomial counting spanning subgraphs with respect to their number of components, edges and covered components. We prove a…
For a finite field of odd number of elements we construct families of permutation binomials and permutation trinomials with one fixed-point (namely zero) and remaining elements being permuted as disjoint cycles of same length. Binomials and…
The u-invariant of a field is the supremum of the dimensions of anisotropic quadratic forms over the field. We define corresponding u-invariants for hermitian and generalised quadratic forms over a division algebra with involution in…