Related papers: Classifying All Degrees Below $N^3$
We investigate two problems for a class C of regular word languages. The C-membership problem asks for an algorithm to decide whether an input language belongs to C. The C-separation problem asks for an algorithm that, given as input two…
Factorization machines and polynomial networks are supervised polynomial models based on an efficient low-rank decomposition. We extend these models to the multi-output setting, i.e., for learning vector-valued functions, with application…
Say a trinomial $x^n+A x^m+B \in \Q[x]$ has reducibility type $(n_1,n_2,...,n_k)$ if there exists a factorization of the trinomial into irreducible polynomials in $\Q[x]$ of degrees $n_1$, $n_2$,...,$n_k$, ordered so that $n_1 \leq n_2 \leq…
Functional transductions realized by two-way transducers (or, equally, by streaming transducers or MSO transductions) are the natural and standard notion of "regular" mappings from words to words. It was shown in 2013 that it is decidable…
We identify a notion of reducibility between predicates, called instance reducibility, which commonly appears in reverse constructive mathematics. The notion can be generally used to compare and classify various principles studied in…
In a quest to thoroughly understand the first-order transduction hierarchy of hereditary graph classes, some questions in particular stand out; such as, what properties hold for graph classes that are first-order transductions of planar…
Polyregular functions are the class of string-to-string functions definable by pebble transducers, an extension of finite-state automata with outputs and multiple two-way reading heads (pebbles) with a stack discipline. If a polyregular…
Automata-logic connections are pillars of the theory of regular languages. Such connections are harder to obtain for transducers, but important results have been obtained recently for word-to-word transformations, showing that the three…
We consider the problem of classifying (possibly noncommutative) R-algebras of low rank over an arbitrary base ring R. We first classify algebras by their degree, and we relate the class of algebras of degree 2 to algebras with a standard…
We describe a classification of degree n complex coefficient polynomials with respect to combinatorial patterns that arise from the two real algebraic curves obtained as the zero sets for their real and imaginary part. In particular, we…
We consider polynomials of the form t^n-1 and determine when members of this family have a divisor of every degree in Z[t]. With F(x) defined to be the number of such integers up to x, we prove the existence of two positive constants c_1…
We classify order $3$ linear difference operators over $\mathbb{C}(x)$ that are solvable in terms of lower order difference operators. To prove this result, we introduce the notion of absolute irreducibility for difference modules, and…
The problem of finding all minimal surfaces presented in parametric form as polynomials of certain degree is discussed by many authors. It is known that the classical Enneper surface is (up to position in space and homothety) the only…
We show that the proportion of polynomials of degree $n$ over the finite field with $q$ elements, which have a divisor of every degree below $n$, is given by $c_q n^{-1} + O(n^{-2})$. More generally, we give an asymptotic formula for the…
We introduce different notions of polynomial convexity with bounds on degrees of polynomials in $\mathbb C^n$. We provide some examples in higher dimensions and show necessary and sufficient conditions for polynomial convexity with degree…
In this article, we introduce a notion of reducibility for partial functions on the natural numbers, which we call subTuring reducibility. One important aspect is that the subTuring degrees correspond to the structure of the realizability…
It will be shown that every N-graded Lie algebra generated in degree 1 of type FP with entropy less or equal to 1 must be finite-dimensional (cf. Thm. A). As a consequence every Koszul Lie algebra with entropy less or equal to 1 must be…
We define "sliding functors", which are exact endofunctors of the category of multi-graded modules over a polynomial ring. They preserve several invariants of modules, especially the (usual) depth and Stanley depth. In a similar way, we can…
A transduction provides us with a way of using the monadic second-order language of a structure to make statements about a derived structure. Any transduction induces a relation on the set of these structures. This article presents a…
Inspired by prior work of Bruinier and Ono and Mertens and Rolen, we study class polynomials for non-holomorphic modular functions arising from modular forms of negative weight. In particular, we give general conditions for the…