Related papers: A consequence of the factorisation theorem for pol…
We show factorization of polynomials in one variable over the tropical semiring is in general NP-complete, either if all coefficients are finite, or if all are either 0 or infinity (Boolean case). We give algorithms for the factorization…
Using the concept of a twisted trace density on a cyclic groupoid, a trace is constructed on a formal deformation quantization of a symplectic orbifold. An algebraic index theorem for orbifolds follows as a consequence of a local…
We present a general method for analytically factorizing the n-fold form factor integrals $f^{(n)}_{N,N}(t)$ for the correlation functions of the Ising model on the diagonal in terms of the hypergeometric functions…
We combine the language of monoids with the language of preorders so as to refine some fundamental aspects of the classical theory of factorization and prove an abstract factorization theorem with a variety of applications. In particular,…
We prove the statement in the title, solving in this way a conjecture stated by Ginot for manifolds with corners. Along the way, we establish a derived Swiss-cheese additivity theorem and an alternative proof for the hyperdescent of…
We generalise the finite biquandle colouring invariant to a polynomial invariant based on labelling a knot diagram with a finite birack that reduces to the biquandle colouring invariant in that case. The polynomial is an invariant of a…
Gleason's theorem [A. Gleason, J. Math. Mech., \textbf{6}, 885 (1957)] is an important result in the foundations of quantum mechanics, where it justifies the Born rule as a mathematical consequence of the quantum formalism. Formally, it…
In this paper we will give a similar factorization as in \cite{4}, \cite{5}, where the autors Svrtan and Meljanac examined certain matrix factorizations on Fock-like representation of a multiparametric quon algebra on the free associative…
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…
We prove two generalisations of the Binomial theorem that are also generalisations of the q-binomial theorem. These generalisations arise from the commutation relations satisfied by the components of the co-multiplications of non-simple…
We prove a general form of the regularity theorem for uniformity norms, and deduce an inverse theorem for these norms which holds for a class of compact nilspaces including all compact abelian groups, and also nilmanifolds; in particular we…
Factorizations over cones and their duals play central roles for many areas of mathematics and computer science. One of the reasons behind this is the ability to find a representation for various objects using a well-structured family of…
We study arithmetic properties of factorizations of elements into products of generators, in monoids given with explicit presentations. After relating and comparing this perspective to the more usual approach of factoring into products of…
An explicit formula is obtained for the generalized Macdonald functions on the $N$-fold Fock tensor spaces, calculating a certain matrix element of a composition of several screened vertex operators. As an application, we prove the…
We pursue a uniform quantization of all twists of 4-dimensional N = 4 supersymmetric Yang-Mills theory, using the BV formalism, and we explore consequences for factorization algebras of observables. Our central result is the construction of…
We present a few factorizations of polynomials over finite fields. These factorizations are related to traces, compositions of polynomials and binomial coefficients. As a corollary we obtain a description of all irreducible polynomials…
This paper is the first part of the series "Spherical higher order Fourier analysis over finite fields", aiming to develop the higher order Fourier analysis method along spheres over finite fields, and to solve the geometric Ramsey…
It is an immediate consequence of the ergodic structure theorem of Host and Kra that every factor of an ergodic $k$-step pro-nilsystem is again an ergodic $k$-step pro-nilsystem. It has remained open whether this fact can be proved…
A convergent algorithm for nonnegative matrix factorization with orthogonality constraints imposed on both factors is proposed in this paper. This factorization concept was first introduced by Ding et al. with intent to further improve…
We generalize a result of Tao which extends Freiman's theorem to the Heisenberg group. We extend it to simply connected nilpotent Lie groups of arbitrary step.