Related papers: A Successive Resultant Projection for Cylindrical …
In the present work, we demonstrate how the pseudoinverse concept from linear algebra can be used to represent and analyze the boundary conditions of linear systems of partial differential equations. This approach has theoretical and…
We apply a symbolic approach of the general quadratic decomposition of polynomial sequences - presented in a previous article referenced herein - to polynomial sequences fulfilling specific orthogonal conditions towards two given…
Seeking tighter relaxations of combinatorial optimization problems, semidefinite programming is a generalization of linear programming that offers better bounds and is still polynomially solvable. Yet, in practice, a semidefinite program is…
Halmos' two projections theorem for Hilbert space operators is one of the fundamental results in operator theory. In this paper, we introduce the term of two harmonious projections in the context of adjointable operators on Hilbert…
We consider algebras $e_i \Pi^\lambda(Q) e_i$ obtained from deformed preprojective algebra of affine type $\Pi^\lambda(Q)$ and an idempotent $e_i$ for certain concrete value of the vector $\lambda$ which corresponds to the traces of $-1\in…
This note discusses how an operator analog of the Lagrange polynomial naturally arises in the quantum-mechanical problem of constructing an explicit form of the spin projection operator.
In the equation of motion approach to the two-time Green's functions, conventional Tyablikov-type truncation of the chain of equations is rather arbitrary and apt to violate the analytical structure of Green's functions. Here, we propose a…
Iterating Newton's method symbolically for the general quadratic yields a rational function, the numerator and denominator of which are polynomials with highly composite coefficients.
We consider the problem of decomposing a multivariate polynomial as the difference of two convex polynomials. We introduce algebraic techniques which reduce this task to linear, second order cone, and semidefinite programming. This allows…
Cylindrical algebraic decomposition (CAD) is a core algorithm within Symbolic Computation, particularly for quantifier elimination over the reals and polynomial systems solving more generally. It is now finding increased application as a…
In this work we consider an iterative method for solving the quasi-convex feasibility problem. We firstly introduce the so-called star subgradient projection operator and present some useful properties. We subsequently obtain a convergence…
Margot (1994) in his doctoral dissertation studied extended formulations of combinatorial polytopes that arise from "smaller" polytopes via some composition rule. He introduced the "projected faces property" of a polytope and showed that…
We construct algebra homomorphisms from affine Yangians to the current algebras of rectangular $W$-algebras both in type A. The construction is given via the coproduct and the evaluation map for the affine Yangians. As a consequence, we…
The extended L\"uroth's Theorem says that if the transcendence degree of $\KK(\mathsf{f}_1,\dots,\mathsf{f}_m)/\KK$ is 1 then there exists $f \in \KK(\underline{X})$ such that $\KK(\mathsf{f}_1,\dots,\mathsf{f}_m)$ is equal to $\KK(f)$. In…
Let $B_n$ be the Euclidean unit ball in ${\mathbb R}^n$ given by the inequality $\|x\|\leq 1$, $\|x\|:=\left(\sum\limits_{i=1}^n x_i^2\right)^{\frac{1}{2}}$. By $C(B_n)$ we mean the space of continuous functions $f:B_n\to{\mathbb R}$ with…
Polynomials which afford nonnegative, real-rooted symmetric decompositions have been investigated recently in algebraic, enumerative and geometric combinatorics. Br\"and\'en and Solus have given sufficient conditions under which the image…
Optical computing has emerged as a promising candidate for real-time and parallel continuous data processing. Motivated by recent progresses in metamaterial-based analog computing [Science 343, 160 (2014)], we theoretically investigate…
We construct a class of representations of the quadratic R-matrix algebra, given by the reflection equation with the spectral parameter, in terms of certain ordinary difference operators. These operators turn out to act as parameter…
In this paper we consider a family of algorithms for approximate implicitization of rational parametric curves and surfaces. The main approximation tool in all of the approaches is the singular value decomposition, and they are therefore…
In this paper we discuss the desingularization algorithm for a toric surface. In particular, we construct an iterable method of determining the Hirzebruch-Jung continued fraction decomposition. These results are then applied to weighted…