Related papers: Explicit Pieri Inclusions
In this paper, a rigorous computational method to enclose eigendecompositions of complex interval matrices is proposed. Each eigenpair $x=(\lambda,v)$ is found by solving a nonlinear equation of the form $f(x)=0$ via a contraction argument.…
The canonical structure of classical non-linear sigma models on Riemannian symmetric spaces, which constitute the most general class of classical non-linear sigma models known to be integrable, is shown to be governed by a fundamental…
This paper is motivated by the question whether there exists a logic capturing polynomial time computation over unordered structures. We consider several algorithmic problems near the border of the known, logically defined complexity…
We propose a new numerical algorithm for computing the tensor rank decomposition or canonical polyadic decomposition of higher-order tensors subject to a rank and genericity constraint. Reformulating this computational problem as a system…
Spinor structure and internal symmetries are considered within one theoretical framework based on the generalized spin and abstract Hilbert space. Complex momentum is understood as a generating kernel of the underlying spinor structure. It…
Polynomial reduction is one of the main tools in computational algebra with innumerable applications in many areas, both pure and applied. Since many years both the theory and an efficient design of the related algorithm have been solidly…
The Pieri rule expresses the product of a Schur function and a single row Schur function in terms of Schur functions. We extend the classical Pieri rule by expressing the product of a skew Schur function and a single row Schur function in…
We consider a countable tree $T$, possibly having vertices with infinite degree, and an arbitrary stochastic nearest neighbour transition operator $P$. We provide a boundary integral representation for general eigenfunctions of $P$ with…
In symmetric Macdonald polynomial theory the Pieri formula gives the branching coefficients for the product of the rth elementary symmetric function and the Macdonald polynomial. In this paper we give the nonsymmetric analogues for the…
We give an algorithm for solving equations and inequations with rational constraints in virtually free groups. Our algorithm is based on Rips classification of measured band complexes. Using canonical representatives, we deduce an algorithm…
The distinguishing result of this paper is a $\mathbf{P}$-time enumerable partition of all the potential perfect matchings in a bipartite graph. This partition is a set of equivalence classes induced by the missing edges in the potential…
Delorme suggested that the set of all complete intersection numerical semigroups can be computed recursively. We have implemented this algorithm, and particularized it to several subfamilies of this class of numerical semigroups: free and…
Feynman periods are Feynman integrals that do not depend on external kinematics. Their computation, which is necessary for many applications of quantum field theory, is greatly facilitated by graphical functions or the equivalent conformal…
A large family of linear, usually overdetermined, systems of partial differential equations that admit a multiplication of solutions, i.e, a bi-linear and commutative mapping on the solution space, is studied. This family of PDE's contains…
Lie group theory states that knowledge of a $m$-parameters solvable group of symmetries of a system of ordinary differential equations allows to reduce by $m$ the number of equation. We apply this principle by finding dilatations and…
This paper introduces a novel general-purpose algorithm for Pauli decomposition that employs matrix slicing and addition rather than expensive matrix multiplication, significantly accelerating the decomposition of multi-qubit matrices. In a…
In this talk we discuss Feynman integrals which are related to elliptic curves. We show with the help of an explicit example that in the set of master integrals more than one elliptic curve may occur. The technique of maximal cuts is a…
A subset of Q^n is called semilinear (or piecewise linear) if it is Boolean combination of linear half-spaces. We study the computational complexity of the constraint satisfaction problem (CSP) over the rationals when all the constraints…
The problem of enumerating meanders -- pairs of simple plane curves with transverse intersections -- was formulated about forty years ago and is still far from solved. Recently, it was discovered that meanders admit a factorization into…
We present an explicit difference operator diagonalized by the Macdonald polynomials associated with an (arbitrary) admissible pair of irreducible reduced crystallographic root systems. By the duality symmetry, this gives rise to an…