Related papers: Polynomial functors in $\text{Ver}_4^+$

In this text, we study factorizations of polynomials over the tropical hyperfield and the sign hyperfield, which we call `tropical polynomials' and `sign polynomials', respectively. We classify all irreducible polynomials in either case. We…

We give an improved polynomial bound on the complexity of the equation solvability problem, or more generally, of finding the value sets of polynomials over finite nilpotent rings. Our proof depends on a result in additive combinatorics,…

We introduce the notion of the generalized-analytical function of the poly-number variable, which is a non-trivial generalization of the notion of analytical function of the complex variable and, therefore, may turn out to be fundamental in…

In this paper, we generalize the principle of the Long-Moody construction for representations of braid groups to other groups, such as mapping class groups of surfaces. Namely, we introduce endofunctors over a functor category that encodes…

We give a lower bound for the degree of an irreducible factor of a given polynomial. This improves and generalizes the results obtained in [4, On the irreducible factors of a polynomial, Proc. Amer. Math. Soc., 148 (2020] 1429 -- 1437].

We prove that any right Quillen functor between arbitrary model categories admits non trivial functorial factorizations that are similar to those of a model structure. We also prove that these factorizations can be made for lax monoidal…

We study the question up to which power an irreducible integer-valued polynomial that is not absolutely irreducible can factor uniquely. For example, for integer-valued polynomials over principal ideal domains with square-free denominator,…

We construct a faithful categorical representation of an infinite Temperley-Lieb algebra on the periplectic analogue of Deligne's category. We use the corresponding combinatorics to classify thick tensor ideals in this periplectic Deligne…

We give a definition of a functor compactifying the functor of bundles on a surfaces. Earlier different authors have defined similar spaces as either images under a morphism or a quotient by an equivalence relation. We use the technique of…

In this short note we show that under very mild conditions on a functor between exact categories $F:\mathcal{D}\rightarrow\mathcal{E}$ it is possible to derive $F$ at the level of unbounded complexes. We also give applications to deriving…

Although NP-Complete problems are the most difficult decisional problems, it is possible to discover in them polynomial (or easy) observables. We study the Graph Partitioning Problem showing that it is possible to recognize in it two…

We adapt (over $\mathbb{F}_2$) the general notions of multiplicative function, Dirichlet convolution and Inverse. We get some interesting results, namely necessary conditions for an odd binary polynomial to be perfect. Note that we are…

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…

Fixed point subalgebras of finite dimensional factor algebras of algebras of polynomials in n indeterminates over the finite field $\mathbb F_2$ (with respect to all $\mathbb F_2$-algebra automorphisms) are fully described.

Second-order polynomials generalize classical first-order ones in allowing for additional variables that range over functions rather than values. We are motivated by their applications in higher-order computational complexity theory,…

The definition of principal nest is supplemented with a system of frames that make possible the classification of combinatorial types for every level of the nest. As a consequence, we give necessary and sufficient conditions for the…

Let $G\subset SO(4)$ denote a finite subgroup containing the Heisenberg group. In these notes we classify all these groups, we find the dimension of the spaces of $G$-invariant polynomials and we give equations for the generators whenever…

We employ the notions of `sequential function' and `interrogation' (dialogue) in order to define new partial combinatory algebra structures on sets of functions. These structures are analyzed using J. Longley's preorder-enriched category of…

We study the polynomial functions on tensor states in $(C^n)^{\otimes k}$ which are invariant under $SU(n)^k$. We describe the space of invariant polynomials in terms of symmetric group representations. For $k$ even, the smallest degree for…

We address an arithmetic problem in the ring $\F_2[x]$ related to the fixed points of the sum of divisors function. We study some binary polynomials $A$ such that $\sigma(A)/A $ is still a binary polynomial. Technically, we prove that the…