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

This work develops user-friendly a posteriori error estimates of finite element methods, based on smoothers of linear iterative solvers. The proposed method employs simple smoothers, such as Jacobi or Gauss-Seidel iteration, on an auxiliary…

It is shown that the Jacobi problem of geodesics on ellipsoid may be reduced to more simple one, namely to the special case of the Clebsch problem. The last one may be solved directly by using Weber's approach in terms of multi-dimensional…

We study Jacobi-Lie Hamiltonian systems admitting Vessiot-Guldberg Lie algebras of Hamiltonian vector fields related to Jacobi structures on real low-dimensional Jacobi-Lie groups. Also, we find some examples of Jacobi-Lie Hamiltonian…

We introduce an algorithm that exploits a combinatorial symmetry of an arrangement in order to produce a geometric reflection between two disconnected components of its moduli space. We apply this method to disqualify three real examples…

We introduce the notion of quadratic hull of a linear code, and give some of its properties. We then show that any symmetric bilinear multiplication algorithm for a finite-dimensional algebra over a field can be obtained by…

This paper studies relationships between the order reductions of ordinary differential equations derived by the existence of $\lambda$-symmetries, telescopic vector fields and some nonlocal symmetries obtained by embedding the equation in…

We provide a framework and algorithm for tuning the hyperparameters of the Graphical Lasso via a bilevel optimization problem solved with a first-order method. In particular, we derive the Jacobian of the Graphical Lasso solution with…

We use Jacob's ladders to solve the fine problem how to divide of the Hardy-Littlewood integral to equal parts, for example of magnitude $h=6.6\times 10^{-27}$ (the numerical value of elementary Planck quantum). The result of the paper…

We consider symmetries and perturbed symmetries of canonical Hamiltonian equations of motion. Specifically we consider the case in which the Hamiltonian equations exhibit a Lambda symmetry under some Lie point vector field. After a brief…

Bisymmetric Macdonald polynomials can be obtained through a process of antisymmetrization and $t$-symmetrization of non-symmetric Macdonald polynomials. Using the double affine Hecke algebra, we show that the evaluation of the bisymmetric…

We analyze several versions of Jacobi's method for the symmetric eigenvalue problem. Our goal is to reduce the asymptotic cost of the algorithm as much as possible, as measured by the number of arithmetic operations performed and associated…

Lambda-symmetries of ODEs were introduced by Muriel and Romero, and discussed by C. Muriel in her talk at SPT2001. Here we provide a geometrical characterization of lambda-prolongations, and a generalization of these -- and of…

Let $\Lambda$ be a quasi-tilted algebra. If $\Lambda$ is representation-finite, it was shown by Happel, Reiten, and Smal{\o} that $\Lambda$ is tilted. We provide a new, short proof of this result.

In this paper we present a systematic way to describe exceptional Jacobi polynomials via two partitions. We give the construction of these polynomials and restate the known aspects of these polynomials in terms of their partitions. The aim…

Using numerical, theoretical and general methods, we construct evaluation formulas for the Jacobi $\theta$ functions. Some of our results are conjectures, but are verified numerically.

Jacobi's elliptic functions have been constructed from a deformed Lie algebra. The generators of the algebra have been obtained from a bi-orthogonal system. The deformation parameter resembles the modulus of the relevant elliptic functions.

Let $\Lambda$ be a finite dimensional algebra over an algebraically closed field $k$. We survey some results on algebras of finite global dimension and address some open problems.

In this paper, we propose a derivative-free Levenberg-Marquardt algorithm for nonlinear least squares problems, where the Jacobian matrices are approximated via orthogonal spherical smoothing. It is shown that the gradient models which use…

This paper deals with exploiting symmetry for solving linear and integer programming problems. Basic properties of linear representations of finite groups can be used to reduce symmetric linear programming to solving linear programs of…

In this paper, we introduce the notion of Jacobi Novikov-Poisson algebras and demonstrate that their affinization yields Jacobi algebras. We note that every unital differential Novikov-Poisson algebra is also a Jacobi Novikov-Poisson…