Related papers: Tower Diagrams and Pieri's Rule
Quadratically optimized polynomials are described which are useful in multi-bosonic algorithms for Monte Carlo simulations of quantum field theories with fermions. Algorithms for the computation of the coefficients and roots of these…
In this paper, we study the arithmetics of skew polynomial rings over finite fields, mostly from an algorithmic point of view. We give various algorithms for fast multiplication, division and extended Euclidean division. We give a precise…
We establish results with an arithmetic flavor that generalize the polynomial multidimensional Szemeredi theorem and related multiple recurrence and convergence results in ergodic theory. For instance, we show that in all these statements…
For systems of polynomial equations, we study the problem of computing the Newton polytope of their eliminants. As was shown by Esterov and Khovanskii, such Newton polytopes are mixed fiber polytopes of the Newton polytopes of the input…
Generalizing supertropical algebras, we present a "layered" structure, "sorted" by a semiring which permits varying ghost layers, and indicate how it is more amenable than the "standard" supertropical construction in factorizations of…
We introduce an efficient way, called Newton algorithm, to study arbitrary ideals in C[[x,y]], using a finite succession of Newton polygons. We codify most of the data of the algorithm in a useful combinatorial object, the Newton tree. For…
New formulas for the construction of Pythagorean triples and generalizations to equations of higher powers. Application of formulas to some problems, in particular Fermat's equation with n=4.
We derive a set of coupled four-dimensional integral equations for the $NN-\pi NN$ system using our modified version of the Taylor method of classification-of-diagrams. These equations are covariant, obey two and three-body unitarity and…
Exploiting the fact that the $q$-Whittaker polynomials arise as a specialization of the (modified) Macdonald polynomials, we derive some of their basic properties, and explore interesting identities that they satisfy. We also show how they…
We explain how to use the probabilistic method to prove the existence of real polynomial singularities with rich topology, i.e. with total Betti number of the maximal possible order. We show how similar ideas can be used to produce real…
We establish a lower bound for the complexity of multiplying two skew polynomials. The lower bound coincides with the upper bound conjectured by Caruso and Borgne in 2017, up to a log factor. We present algorithms for three special cases,…
We modify Wythoff's game by allowing an additional move, which we call a "split", and show how the $P$-positions are coded by the Tribonacci word. We analyze the table of letter positions of arbitrary $k$-bonacci words and find a…
The immaculate basis of the non-commutative symmetric functions was recently introduced by the first and third author to lift certain structures in the symmetric functions to the dual Hopf algebras of the non-commutative and quasi-symmetric…
The article presents the theoretical background of the algorithms for solving cyclic block tridiagonal and cyclic block penta-diagonal systems of linear algebraic equations present in ref [1] and [2]. The theory is based on the Woodbury…
We introduce in this section an Algebraic and Combinatorial approach to the theory of Numbers. The approach rests on the observation that numbers can be identified with familiar combinatorial objects namely rooted trees, which we shall here…
In this paper polynomial maps are represented by the use of matrices whose entries are numbered by pair of multiindices and a new product of such matrices is introduced. A matrix representation of composition of polynomial maps is given. In…
We give a direct proof of the equivalence between the Giambelli and Pieri type formulas for Hall-Littlewood functions using Young's raising operators, parallel to joint work with Buch and Kresch for the Schubert classes on isotropic…
In this paper we use Euler-Seidel matrices method to find out some properties of exponential and geometric polynomials and numbers. Some known results are reproved and some new results are obtained.
Given the $n\times n$ matrix polynomial $P(x)=\sum_{i=0}^kP_i x^i$, we consider the associated polynomial eigenvalue problem. This problem, viewed in terms of computing the roots of the scalar polynomial $\det P(x)$, is treated in…
We develop a collection of numerical algorithms which connect ideas from polyhedral geometry and algebraic geometry. The first algorithm we develop functions as a numerical oracle for the Newton polytope of a hypersurface and is based on…