Related papers: An algorithmic approach to the Polydegree Conjectu…

We enhance the approximation capabilities of algebraic polynomials by composing them with homeomorphisms. This composition yields families of functions that remain dense in the space of continuous functions, while enabling more accurate…

A class of differential calculi is explored which is determined by a set of automorphisms of the underlying associative algebra. Several examples are presented. In particular, differential calculi on the quantum plane, the $h$-deformed…

Two Lie algebroids are presented that are linked to the construction of the linearizing output of an affine in the input nonlinear system. The algorithmic construction of the linearizing output proceeds inductively, and each stage has two…

First we prove that any inner automorphism in the stabilizer of a graded-simple unital associative algebra whose grading group is abelian is the conjugation by a homogeneous element. Now consider a grading by an abelian group on an…

We study polynomial functors over locally cartesian closed categories. After setting up the basic theory, we show how polynomial functors assemble into a double category, in fact a framed bicategory. We show that the free monad on a…

Given a planar curve defined by means of a real rational parametrization, we prove that the affine values of the parameter generating the real singularities of the offset are real roots of a univariate polynomial that can be derived from…

We give an algorithm to determine whether Wilf's conjecture holds for all numerical semigroups with a given multiplicity $m$, and use it to prove Wilf's conjecture holds whenever $m \le 18$. Our algorithm utilizes techniques from polyhedral…

The fundamental theorem of affine geometry says that a self-bijection $f$ of a finite-dimensional affine space over a possibly skew field takes left affine subspaces to left affine subspaces of the same dimension, then $f$ of the expected…

In this paper, we give a polynomial-time algorithm for deciding whether an input bipartite graph admits a 2-layer fan-planar drawing, resolving an open problem posed in several papers since 2015.

We consider the disjoint bilinear programming problem in which one of the disjoint subsets has the structure of an acute-angled polytope. An optimality criterion for such a problem is formulated and proved, and based on this, a polynomial…

The object of this paper is the tameness conjecture which describes an arbitrary graded k-algebra homomorphism of polytopal rings. We give further evidence of this conjecture by showing supporting results concerning joins, multiples and…

We construct the ordinary irreducible representations of the group of automorphisms of a finite rooted tree and we get a natural parametrization of them. To achieve this goals, we introduce and study the combinatorics of tree compositions,…

Given a polynomial endomorphism F of the n-dimensional affine space over a field K, we define a sequence of polynomial endomorphisms of the affine space associated to F. We call F nice if there exists an integer m such that the m-th term of…

We provide an effective algorithm for determining whether an element of the outer automorphism group of a free group is fully irreducible. Our method produces a finite list which can be checked for periodic proper free factors.

Automorphisms of finite order and real forms of "smooth" affine Kac-Moody algebras are studied, i.e. of 2-dimensional extensions of the algebra of smooth loops in a simple Lie algebra. It is shown that they can be parametrized by certain…

Hyperplane arrangements form the latest addition to the zoo of combinatorial objects dealt with by polymake. We report on their implementation and on a algorithm to compute the associated cell decomposition. The implemented algorithm…

We offer a criterion for showing that the automorphism group of an ultrahomogeneous structure is topologically 2-generated and even has a cyclically dense conjugacy class. We then show how finite topological rank of the automorphism group…

We confirm a conjecture of Friedland and Milnor: if two polynomial automorphisms f and g in Aut(C^2) with dynamical degree >1 are conjugate by some holomorphic diffeomorphism \phi of C^2, then \phi is a polynomial automorphism; thus, f and…

We show that the problem to decide whether two (convex) polytopes, given by their vertex-facet incidences, are combinatorially isomorphic is graph isomorphism complete, even for simple or simplicial polytopes. On the other hand, we give a…

In the classical setting, a convex polytope is said to be semiregular if its facets are regular and its symmetry group is transitive on vertices. This paper studies semiregular abstract polytopes, which have abstract regular facets, still…