Related papers: $\lambda$-symmetries and Jacobi Last Multiplier

We define a version of multiplier ideals, the Mather multiplier ideals, on a variety with arbitrary singularities, using the Mather discrepancy and the Jacobian ideal. In this context we prove a relative vanishing theorem, thus obtaining…

A proper choice of parameters of the Jacobi modular identity (Jacobi Imaginary transformation) implies that the summation of Gaussian shifts on infinity periodic grids can be represented as the Jacobi's third Theta function. As such,…

After the introduction of $\lambda$-symmetries by Muriel and Romero, several other types of so called "twisted symmetries" have been considered in the literature (their name refers to the fact they are defined through a deformation of the…

Some symmetry problems are formulated and solved. New simple proofs are given for the earlier studied symmetry problems.

Some new bounds for the extreme zeroes of Jacobi polynomials are obtained with an elementary approach. A feature of these bounds is their simple forms, which make them easy to work with. Despite their simplicity, our lower bounds for the…

We study a family of Jacobi operators in which the diagonal entries are multiplied by a coupling parameter $\lambda\geq0$. Under suitable conditions, the operator is self-adjoint for every $\lambda>0$, while the formal limit at $\lambda=0$…

We study the spectral theory of a class of piecewise centrosymmetric Jacobi operators defined on an associated family of substitution graphs. Given a finite centrosymmetric matrix viewed as a weight matrix on a finite directed path graph…

We give new identities for some symmetric polynomials. As applications of these identities, we obtain some formulas for a higher order analogue of Fibonacci and Lucas numbers.

An effective numerical method is presented for optimizing model parameters that can be applied to any type of system of non-linear equations and any number of data-points, which does not require explicit formulation of the objective…

Symmetries and reductions of some algebraic equations are considered. Transformations that preserve the form of several algebraic equations, as well as transformations that reduce the degree of these equations, are described. Illustrative…

A novel approach to an old symmetry problem is developed. A new proof is given for the following symmetry problem, studied earlier.

In this paper we obtain a set of five new transmutations of the mother formula. Further, we obtain the second set of ten exact metafunctional equations by crossbreeding on every two elements of the previous set. Elements of the last set…

Rounding linear programs using techniques from discrepancy is a recent approach that has been very successful in certain settings. However this method also has some limitations when compared to approaches such as randomized and iterative…

We look for differential equations satisfied by the generalized Jacobi polynomials which are orthogonal on the interval [-1,1] with respect to a weight function consisting of the classical Jacobi weight function together with point masses…

The applicability of advanced classical mechanics (viz., the Lagrangian and/or Hamiltonian approaches) to real-world problems may not always seem straightforward, despite the mathematical rigor and elegance of this field. Here, we present a…

The goal of the present paper is to provide a detailed study of irreducible representations of the algebra generated by the symmetries of the generic quantum superintegrable system on the $d$-sphere. Appropriately normalized, the symmetry…

We describe two main classes of one-sided trigonometric and hyperbolic Jacobi-type algorithms for computing eigenvalues and eigenvectors of Hermitian matrices. These types of algorithms exhibit significant advantages over many other…

Szmytkowski derived a certain integral with Gegenbauer polynomials. A natural generalization is to derive lookalike integrals with Jacobi polynomials. Six methods are treated to derive the first integral. The first method should be enough…

We obtain various versions of classical Lieb--Thirring bounds for one- and multi-dimensional complex Jacobi matrices. Our method is based on Fan-Mirski Lemma and seems to be fairly general.

This paper develops a smoothing-based postprocessing method for superconvergence in finite element methods. The method applies a few smoothing iterations, such as damped Jacobi, Gauss-Seidel, or conjugate gradient, with initial guess being…