Related papers: Computation of generating symmetries
The Gardner method, traditionally used to generate conservation laws of integrable equations, is generalized to generate symmetries. The method is demonstrated for the KdV, Camassa-Holm and Sine-Gordon equations. The method involves…
We revisit the symmetry structure of integrable PDEs, looking at the specific example of the KdV equation. We identify 4 nonlocal symmetries of KdV depending on a parameter, which we call generating symmetries. We explain that since these…
Correctly capturing the symmetry transformations of data can lead to efficient models with strong generalization capabilities, though methods incorporating symmetries often require prior knowledge. While recent advancements have been made…
In this article we describe an algorithm that can be applied for the generation of various classes of maps on orientable surfaces. It uses existing generators for abstract graphs and combines them with an efficient embedding and isomorphism…
In this paper we provide, first, a general symbolic algorithm for computing the symmetries of a given rational surface, based on the classical differential invariants of surfaces, i.e. Gauss curvature and mean curvature. In practice, the…
Normal map is an important and efficient way to represent complex 3D models. A designer may benefit from the auto-generation of high quality and accurate normal maps from freehand sketches in 3D content creation. This paper proposes a deep…
In the field of complex networks and graph theory, new results are typically tested on graphs generated by a variety of algorithms such as the Erd\H{o}s-R\'{e}nyi model or the Barab\'{a}si-Albert model. Unfortunately, most graph generating…
We use group theoretic methods to obtain the extended Lie point symmetries of the equations of motion for a charged particle in the field of a monopole. Cases with certain model magnetic fields and potentials are also studied. Our analysis…
In this paper, a new method for generation of infinite series of symmetric identities written for exponential sums in real numbers is proposed. Such systems have numerous applications in theory of numbers, chaos theory, algorithmic…
An analogy is drawn between recent work with Kley (math.AG/0007082) and the WDVV equations. That is, both are regarded as symmetries of generating functions with coefficients that "count" rational curves on a complex projective manifold. It…
We perform a systematic symmetry classification of the Markov generators of classical stochastic processes. Our classification scheme is based on the action of involutive symmetry transformations of a real Markov generator, extending the…
Many combinatorial generating functions can be expressed as combinations of symmetric functions, or extracted as sub-series and specializations from such combinations. Gessel has outlined a large class of symmetric functions for which the…
Some inequalities for positive linear maps on matrix algebras are given, especially asymmetric extensions of Kadison's inequality and several operator versions of Chebyshev's inequality. We also discuss well-known results around the matrix…
This is the second of two articles devoted to an exposition of the generating-function method for computing fusion rules in affine Lie algebras. The present paper focuses on fusion rules, using the machinery developed for tensor products in…
In this chapter, we discuss normal generators for mapping class groups of surfaces. Especially, we focus on the relation between normal generation of a mapping class with its asymptotic translation lengths on the Teichm\"uller space and the…
In this paper we present a Mathematica notebook for computing nonsymmetric and interpolation Macdonald polynomials. We present the new recursive generation algorithm employed within the notebook and the theory required for its development.…
We explore the application of generating symmetries, i.e. symmetries that depend on a parameter, to integrable hyperbolic third order equations, and in particular to consistent pairs of such equations as introduced by Adler and Shabat (AS).…
In [7], a new iterative method for solving linear system of equations was presented which can be considered as a modification of the Gauss-Seidel method. Then in [4] a different approach, say 2D-DSPM, and more effective one was introduced.…
A generic method for combinatorial constructions of intrinsic geometrical spaces is presented. It is based on the well known inverse sequences of finite graphs that determine (in the limit) topological spaces. If a pattern of the…
Supersymmetry is formulated for integrable models based on the $sl(2|1)$ loop algebra endowed with a principal gradation. The symmetry transformations which have half-integer grades generate supersymmetry. The $sl(2|1)$ loop algebra leads…