相关论文: Formalizing Polynomial Laws and the Universal Divi…

In the complexity estimation for an attack that reduces a cryptosystem to solving a system of polynomial equations, the degree of regularity and an upper bound of the first fall degree are often used in cryptanalysis. While the degree of…

Two decades ago P. Martin and D. Woodcock made a surprising and prophetic link between statistical mechanics and representation theory. They observed that the decomposition numbers of the blob algebra (that appeared in the context of…

Despite the considerable interest in new dependent type theories, simple type theory (which dates from 1940) is sufficient to formalise serious topics in mathematics. This point is seen by examining formal proofs of a theorem about…

We associate to a multiple polylogarithm a holomorphic 1-form on the universal abelian cover of its domain. We relate the 1-forms to the symbol and variation matrix and show that the 1-forms naturally define a lift of the variation of mixed…

We introduce the general polynomial algebras characterizing a class of higher order superintegrable systems that separate in Cartesian coordinates. The construction relies on underlying polynomial Heisenberg algebras and their defining…

This paper describes a formal theory of smooth vector fields, Lie groups and the Lie algebra of a Lie group in the theorem prover Isabelle. Lie groups are abstract structures that are composable, invertible and differentiable. They are…

The functional decomposition of polynomials has been a topic of great interest and importance in pure and computer algebra and their applications. The structure of compositions of (suitably normalized) polynomials f=g(h) over finite fields…

The article focuses on three different notions of polynomiality for maps of modules. In addition to the polynomial maps studied by Eilenberg and Mac Lane and the strict polynomial maps ("lois polynomes") considered by Roby, we introduce…

We study the decomposition of multivariate polynomials as sums of powers of linear forms. As one of our main results we give an algorithm for the following problem: given a homogeneous polynomial of degree 3, decide whether it can be…

In this article, the ring of polynomials is studied in a systematic way through the theory of monoid rings. As a consequence, this study provides natural and canonical approaches in order to find easy and rigorous proofs and methods for…

A polynomial that is nonnegative need not be a sum of squares of polynomials. This classical gap, identified by Hilbert in 1888, lies at the heart of why the global optimization of multivariate quartic polynomials is NP-hard. Yet we show…

The main purpose of this paper is to show that the mixed Hodge polynomial of the ``space of equations'' for smooth complete intersections of given multidegree in $\mathbb{C} P^n$ is divisible by the mixed Hodge polynomial of the group…

Holonomy algebras arise naturally in the classical description of Yang-Mills fields and gravity, and it has been suggested, at a heuristic level, that they may also play an important role in a non-perturbative treatment of the quantum…

In the present paper, we prove the existence of universal polynomials which express multi-singularity loci classes of prescribed types for proper morphisms between smooth schemes over an algebraically closed field of characteristic zero --…

A graded-division algebra is an algebra graded by a group such that all nonzero homogeneous elements are invertible. This includes division algebras equipped with an arbitrary group grading (including the trivial grading). We show that a…

We introduce power term polynomial algebra, a representation language for Boolean formulae designed to bridge conjunctive normal form (CNF) and algebraic normal form (ANF). The language is motivated by the tiling mismatch between these…

We introduce uniparametric and multiparametric quantisations of the general linear supergroup, in the form of "quantised function algebras", both in a formal setting - yielding "quantum formal series Hopf superalgebras", a` la Drinfeld -…

We formalize Hall's Marriage Theorem in the Lean theorem prover for inclusion in mathlib, which is a community-driven effort to build a unified mathematics library for Lean. One goal of the mathlib project is to contain all of the topics of…

A Souslin algebra is a complete Boolean algebra whose main features are ruled by a tight combination of an antichain condition with an infinite distributive law. The present article divides into two parts. In the first part a representation…

The notion of a complete Boolean algebra, although completely legitimate in constructive mathematics, fails to capture some natural structures such as the lattice of subsets of a given set. Sambin's notion of an overlap algebra, although…