Related papers: On the Thom-Boardman Symbols for Polynomial Multip…
We present an exact and complete algorithm to isolate the real solutions of a zero-dimensional bivariate polynomial system. The proposed algorithm constitutes an elimination method which improves upon existing approaches in a number of…
In the literature, there exist several studies on symbol-based multigrid methods for the solution of linear systems having structured coefficient matrices. In particular, the convergence analysis for such methods has been obtained in an…
It's important to design polynomial time algorithms to test if two graphs are isomorphic at least for some special classes of graphs. An approach to this was presented by Eugene M. Luks(1981) in the work \textit{Isomorphism of Graphs of…
We introduce partial differential encodings of Boolean functions as a way of measuring the complexity of Boolean functions. These encodings enable us to derive from group actions non-trivial bounds on the Chow-Rank of polynomials used to…
Symbol-pair codes, introduced by Cassuto and Blaum [1], have been raised for symbol-pair read channels. This new idea is motivated by the limitation of the reading process in high-density data storage technologies. Yaakobi et al. [8]…
In this paper we derive an upper bound for the degree of the strict invariant algebraic curve of a polynomial system in the complex project plane under generic condition. The results are obtained through the algebraic multiplicities of the…
We study functorial polymultiplicative maps from the multiplicative group of the algebra of $n$-times iterated Laurent series over a commutative ring in $n+1$ variables into the multiplicative group of the ring. It is proven that if such a…
Symbolic encoding has been used in multi-operator learning as a way to embed additional information for distinct time-series data. For spatiotemporal systems described by time-dependent partial differential equations, the equation itself…
We consider some known and some new properties of the family of polynomials introduced by Ted Suffridge in 1969. We begin by giving a brief overview of their extremal properties in classic and more recent work. We also give a compact form…
Polynomials on stranded graphs are higher dimensional generalization of Tutte and Bollob\'as-Riordan polynomials [Math. Ann. 323 (2002), 81-96]. Here, we deepen the analysis of the polynomial invariant defined on rank 3 weakly-colored…
Polynomial regression is widely used and can help to express nonlinear patterns. However, considering very high polynomial orders may lead to overfitting and poor extrapolation ability for unseen data. The paper presents a method for…
This paper reviews the description of "bar codes" for a continuous real-valued map and explains how to recover the Morse complex of a Morse function from them. In this presentation the bar codes appear as the support of two vector-space…
Initiated by Mulmuley, Vazirani, and Vazirani (1987), many algebraic algorithms have been developed for matching and related problems. In this paper, we review basic facts and discuss possible improvements with the aid of fast computation…
Born-Jordan operators are a class of pseudodifferential operators arising as a generalization of the quantization rule for polynomials on the phase space introduced by Born and Jordan in 1925. The weak definition of such operators involves…
We present an accurate investigation of the algebraic conditions that the symbols of a convergent, univariate, binary, non-stationary subdivision scheme should fulfill in order to reproduce spaces of exponential polynomials. A subdivision…
In 2014, Darmon and Rotger defined the Garrett-Rankin triple product $p$-adic $L$- function and related it to the image of certain diagonal cycles under the $p$-adic Abel- Jacobi map. We introduce a new $p$-adic triple symbol based on this…
We prove lower bounds of order $n\log n$ for both the problem to multiply polynomials of degree $n$, and to divide polynomials with remainder, in the model of bounded coefficient arithmetic circuits over the complex numbers. These lower…
Multiple polylogarithms are periods of variations of mixed Tate motives. Conjecturally, they deliver all such periods. We introduce deformations of multiple polylogarithms depending on a complex parameter h. We call them quantum…
Polynomial assignments for a torus $T$-action on a smooth manifold $M$ were introduced by Ginzburg, Guillemin, and Karshon in 1999; they form a module over $\mathbb{S}(\mathfrak{t}^*)$, the algebra of polynomial functions on $\mathfrak{t}$,…
In 1909 Borel defined normality as a notion of randomness of the digits of the representation of a real number over certain base (fractional expansion). If we think the representation of a number over a base as an infinite sequence of…