Related papers: Tame Key polynomials
Tame arrangements were informally introduced by Orlik and Terao for the study of Milnor fibers of hyperplane arrangements. After that, tame arrangements have been applied to a lot of researches on arrangements including freeness, master…
We reduce the problem of constructing asymptotically good tree codes to the construction of triangular totally nonsingular matrices over fields with polynomially many elements. We show a connection of this problem to Birkhoff interpolation…
We consider various counting questions for irreducible binomials over finite fields. We use various results from analytic number theory to investigate these questions.
We study just infinite algebras which remain so upon extension of scalars by arbitrary field extensions. Such rings are called stably just infinite. We show that just infinite rings over algebraically closed fields are stably just infinite…
The technique of "extension" allows to build $(n+1)$-dimensional Hamiltonian systems with a non-trivial polynomial in the momenta first integral of any given degree starting from a $n$-dimensional Hamiltonian satisfying some additional…
Refining a constructive combinatorial method due to MacLane and Schilling, we give several criteria for a valued field that guarantee that all of its maximal immediate extensions have infinite transcendence degree. If the value group of the…
We study the behaviour of forking in valued fields, and we give several sufficient conditions for parameter sets in a Henselian valued field of residue characteristic zero to be an extension base. Notably, we consider arbitrary (potentially…
A univariate polynomial f over a field is decomposable if f = g o h = g(h) for nonlinear polynomials g and h. It is intuitively clear that the decomposable polynomials form a small minority among all polynomials over a finite field. The…
Tensor expression simplification is an "ancient" topic in computer algebra, a representative of which is the canonicalization of Riemann tensor polynomials. Practically fast algorithms exist for monoterm canonicalization, but not for…
Previous research on exceptional units has primarily focused on the ring of rational integers or abstract finite rings, often restricted to linear or quadratic constraints. In this paper, we extend the concept of polynomial-type exceptional…
We prove that generating subspaces of matrix rings over finite fields are counted by polynomials. We use this result to define and study two-variable versions of polynomials counting isomorphism classes of absolutely irreducible…
In this paper we extend some set theoretic concepts of numerical semigroups for arbitrary sub-semigroups of natural numbers. Then we characterized gapsets which leads to a more efficient computational approach towards numerical semigroups…
We investigate bicomplex analogues of fundamental notions from classical algebraic number theory. In particular, we show that the primitive element theorem admits a natural generalization to bicomplex extensions, giving rise to two distinct…
We compute an analogue of Pascal's triangle enriched in bilinear forms over a finite field. This gives an arithmetically meaningful count of the ways to choose $j$ ring homomorphisms into an algebraic closure from an \'etale extension of…
We show a transfer principle for the property that all types realised in a given elementary extension are definable. It can be written as follows: a Henselian valued fields is stably embedded in an elementary extension if and only if its…
Some important properties of the chromatic polynomial also hold for any polynomial set map satisfying p_S(x+y)=\sum_{T\uplus U=S}p_T(x)p_U(y). Using umbral calculus, we give a formula for the expansion of such a set map in terms of any…
We introduce several new constructions of finite posets with the number of linear extensions given by generalized continued fractions. We apply our results to the problem of the minimum number of elements needed for a poset with a given…
In this paper the transcendental Galois extensions of a field will be introduced as counterparts to algebraic Galois ones. There exist several types of transcendental Galois extensions of a given field, from the weakest one to the strongest…
Let $\mathbb{C}_v$ be a characteristic zero algebraically closed field which is complete with respect to a non-Archimedean absolute value. We provide a necessary and sufficient condition for two tame polynomials in $\mathbb{C}_v[z]$ of…
New and old results on closed polynomials, i.e., such polynomials f in K[x_1,...,x_n] that the subalgebra K[f] is integrally closed in K[x_1,...,x_n], are collected. Using some properties of closed polynomials we prove the following…