Related papers: Computation of generating symmetries
It is investigated how two (standard or generalized) $\lambda-$symmetries of a given second-order ordinary differential equation can be used to solve the equation by quadratures. The method is based on the construction of two commuting…
This work deals with the generation of theoretical correlation matrices with specific sparsity patterns, associated to graph structures. We present a novel approach based on convex optimization, offering greater flexibility compared to…
We study a generating function for the sum over fatgraphs with specified valences of vertices and faces, inversely weighted by the order of their symmetry group. A compact expression is found for general (i.e. non necessarily connected)…
For a group $G$, the generating graph $\Gamma(G)$ is defined as the graph with the vertex set $G$, and any two distinct vertices of $\Gamma(G)$ are adjacent if they generate $G$. In this paper, we study the generating graph of $D_n,$ where…
In this article we present first an algorithm for calculating the determining equations associated with so-called ``nonclassical method'' of symmetry reductions (a la Bluman and Cole) for systems of partial differentail equations. This…
We describe here an experimental method that permits to compute a good candidate for the closed form of a generating function if we know the first few terms of a series. The method is based on integer relations algorithms and uses either…
The non-isospectral symmetries of a general class of integrable hierarchies are found, generalizing the Galilean and scaling symmetries of the Korteweg--de Vries equation and its hierarchy. The symmetries arise in a very natural way from…
The knowledge of {\it non usual} and sometimes {\it hidden} symmetries of (classical) integrable systems provides a very powerful setting-out of solutions of these models. Primarily, the understanding and possibly the quantisation of…
In this paper we explore a family of congruences over $\N^\ast$ from which one builds a sequence of symmetric matrices related to the Mertens function. From the results of numerical experiments, we formulate a conjecture about the growth of…
We suggest an algorithm allowing to obtain some new integral-geometric formulae from the existing formulae of Crofton type. These new formulae are applied to get smooth versions of BKK theorem. The algorithm is based on the calculations in…
We study the numerical simulation of supersymmetric models having a local Nicolai map. The mapping can be regarded as a stochastic equation and its numerical integration provides an algorithm for the simulation of the original model. In…
A novel approach is introduced for deriving exact solutions to nonlinear systems of ordinary differential equations. This method consists of four parts. In the initial part, the examined nonlinear differential equation system is transformed…
The main purpose of this paper is providing a simple method to generate the matrices of irreducible representations because it is useful to reduce the computational time of solving the eigenvalue problems. The only information we need to…
A method for successive synthesis of a Weyl matrix (or Dirichlet-to-Neumann map) of an arbitrary quantum tree is proposed. It allows one, starting from one boundary edge, to compute the Weyl matrix of a whole quantum graph by adding on new…
The algebra of invariants of d-tuples of n x n skew-symmetric matrices under the action of the orthogonal group by simultaneous conjugation is considered over an infinite field of characteristic different from two. For n=3 and d>0 a minimal…
A recursive method is given for finding generating functions which enumerate rooted hypermaps by number of vertices, edges and faces for any given number of darts. It makes use of matrix-integral expressions arising from the study of…
In this paper I show a geometrical method to obtain construction of the Nikodym type set.
A new generalized cyclic symmetric structure in the factor matrices of polyadic decompositions of matrix multiplication tensors for non-square matrix multiplication is proposed to reduce the number of variables in the optimization problem…
The gap probability generating function has as its coefficients the probability of an interval containing exactly $k$ eigenvalues. For scaled random matrices with orthogonal symmetry, and the interval at the hard or soft spectrum edge, the…
In this article, we develop a process to symmetrize the irreducible admissible representation of $GL_N(\mathbb{Q}_p)$, as a consequence we obtain a more geometric understanding of the coefficient $m(\mathbf{b}, \mathbf{a})$ appearing in the…