Related papers: On the Thom-Boardman Symbols for Polynomial Multip…
We describe a provably quasi-polynomial algorithm to compute discrete logarithms in the multiplicative groups of finite fields of small characteristic, that is finite fields whose characteristic is logarithmic in the order. We partially…
We study the bit complexity of two methods, related to the Euclidean algorithm, for computing cubic and quartic analogs of the Jacobi symbol. The main bottleneck in such procedures is computation of a quotient for long division. We give…
In 1888, Hilbert described how to find real polynomials in more than one variable which take only non-negative values but are not a sum of squares of polynomials. His construction was so restrictive that no explicit examples appeared until…
Permutation-partition pairs were introduced by Stahl in 1980. These pairs are generalizations of graphs and graphs on surfaces. They were used to solve some problems for orientable embeddings of graphs. In this paper, we introduce a…
This paper is our second step towards developing a theory of testing monomials in multivariate polynomials. The central question is to ask whether a polynomial represented by an arithmetic circuit has some types of monomials in its…
The $M$-polynomial was introduced by Deutsch and Klav\v{z}ar in 2015 as a graph polynomial to provide an easy way to find closed formulas of degree-based topological indices, which are used to predict physical, chemical, and pharmacological…
Period mappings were introduced in the sixties [G] to study variation of complex structures of families of algebraic varieties. The theory of tautological systems was introduced recently [LSY,LY] to understand period integrals of algebraic…
Diagonal matrix elements of pseudodifferential operators are needed in order to compute effective Lagrangians and currents. For this purpose the method of symbols is often used, which however lacks manifest covariance. In this work the…
The author has introduced in a recent paper a new class of operators, called co-Toeplitz operators, with symbols in a co-algebra. This is the categorical dual to Toeplitz operators which have symbols in an algebra. The mapping from a symbol…
Triple symbols are arithmetic analogues of the mod $n$ triple linking number in topology, where $n > 1$ is an integer. In this paper, we introduce a cohomological formulation of a mod $n$ triple symbol for characters over a number field…
A map between manifolds induces stratifications of both the source and the target according to the occurring multisingularities. In this paper, we study universal expressions-called higher Thom polynomials-that describe the…
Thom polynomials of singularities express the cohomology classes dual to singularity submanifolds. A stabilization property of Thom polynomials is known classically, namely that trivial unfolding does not change the Thom polynomial. In this…
Polynomial factorization in conventional sense is an ill-posed problem due to its discontinuity with respect to coefficient perturbations, making it a challenge for numerical computation using empirical data. As a regularization, this paper…
We recall Labatie's effective method of solving polynomial equations with two unknowns by using the Euclidean algorithm.
We use a result on mixed Tate motives due to Goncharov (arXiv:alg-geom/9601021) to show that the symbol of an arbitrary one-loop 2m-gon integral in 2m dimensions may be read off directly from its Feynman parameterization. The algorithm…
We consider the following construction of quantization. For a Riemannian manifold $M$ the space of forms on $T^*M$ is made into a space of (full) symbols of operators acting on forms on $M$. This gives rise to the composition of symbols,…
In this paper, we review the theory of time space-harmonic polynomials developed by using a symbolic device known in the literature as the classical umbral calculus. The advantage of this symbolic tool is twofold. First a moment…
Multivariate multiplicity codes (Kopparty, Saraf, and Yekhanin, J. ACM 2014) are linear codes where the codewords are described by evaluations of multivariate polynomials (with a degree bound) and their derivatives up to a fixed order, on a…
We propose new algorithms for computing triangular decompositions of polynomial systems incrementally. With respect to previous works, our improvements are based on a {\em weakened} notion of a polynomial GCD modulo a regular chain, which…
Polyhomogeneous symbols, defined by Kohn-Nirenberg and H\"ormander in the 60's, play a central role in the symbolic calculus of most pseudodifferential calculi. We prove a simple characterisation of polyhomogeneous functions which avoids…