Related papers: Calculation of Thom polynomials for group actions

We compute the factorization homology of a polynomial algebra over a compact and closed manifold with trivialized tangent bundle up to weak equivalence in a new way. This calculation is based on the model of a graph complex and an explicit…

We survey various Alexander-type invariants of plane curve complements, with an emphasis on obstructions on the type of groups that can arise as fundamental groups of complements to complex plane curves. Also included are some new…

In this paper, we consider the existence of a factorization of a monic, bounded motion polynomial. We prove existence of factorizations, possibly after multiplication with a real polynomial and provide algorithms for computing polynomial…

We compute the cohomology of the complement of toric arrangements associated to root systems as representations of the corresponding Weyl groups. Specifically, we develop an algorithm for computing the cohomology of the complement of toric…

In this paper, we present a functorial method to define ramification groups, identifying them as inertia groups of an induced action on composite jet algebras. This framework lays the foundation for defining higher ramification groups for…

We study the problem of generating monomials of a polynomial in the context of enumeration complexity. In this setting, the complexity measure is the delay between two solutions and the total time. We present two new algorithms for…

Motion polynomials (polynomials over the dual quaternions with nonzero real norm) describe rational motions. We present a necessary and sufficient condition for reduced bounded motion polynomials to admit factorizations into monic linear…

The purpose of this paper is to prove the localization theorem for torus actions in equivariant intersection theory. Using the theorem we give another proof of the Bott residue formula for Chern numbers of bundles on smooth complete…

In the previous paper, we studied obstructions to the existence of complex sections on almost complex manifolds up to cobordism. We determined the obstruction rationally, in terms of the Chern classes. In this paper, we study the torsion…

The monodromy group is an invariant for parameterized systems of polynomial equations that encodes structure of the solutions over the parameter space. Since the structure of real solutions over real parameter spaces are of interest in many…

Motion polynomials are a specific type of polynomial over a Clifford algebra that can conveniently describe rational motions. There exists an algorithm for the factorization of motion polynomials that works in generic cases. It hinges on…

The goal of this article is to obtain bounds on the coefficients of modular and integral flow and tension polynomials of graphs. To this end we make use of the fact that these polynomials can be realized as Ehrhart polynomials of inside-out…

In this work, we present an efficient method for computing in the Generalized Jacobian of special singular curves. The efficiency of the operation is due to representation of an element in the Jacobian group by a single polynomial.

Given a diagram of Pi-algebras (graded groups equipped with an action of the primary homotopy operations), we ask whether it can be realized as the homotopy groups of a diagram of spaces. The answer given here is in the form of an…

Many natural computational problems in computer science, mathematics, physics, and other sciences amount to deciding if two objects are equivalent. Often this equivalence is defined in terms of group actions. A natural question is to ask…

Solving polynomial equations is a subtask of polynomial optimization. This article introduces systems of such equations and the main approaches for solving them. We discuss critical point equations, algebraic varieties, and solution counts.…

Polynomial invariants corresponding to the fundamental representation of the gauge group $SU(N)$ are computed for arbitrary torus knots and links in the framework of Chern-Simons gauge theory making use of knot operators. As a result, a…

Polynomial functors are a categorical generalization of the usual notion of polynomial, which has found many applications in higher categories and type theory: those are generated by polynomials consisting a set of monomials built from sets…

The analysis of observable phenomena (for instance, in biology or physics) allows the detection of dynamical behaviors and, conversely, starting from a desired behavior allows the design of objects exhibiting that behavior in engineering.…

Let A be a finite abelian group. We set up an algebraic framework for studying A-equivariant complex-orientable cohomology theories in terms of a suitable kind of equivariant formal groups. We compute the equivariant cohomology of many…