Related papers: Computation of generating symmetries
We solve the problem of description for nonsingular pairs of compatible flat metrics in the general N-component case. The integrable nonlinear partial differential equations describing all nonsingular pairs of compatible flat metrics (or,…
A set of Maple V R.3/4 computer algebra routines for the analytical solving of 1st. order ODEs, using Lie group symmetry methods, is presented. The set of commands includes a 1st. order ODE-solver and routines for, among other things: the…
Using the theory of equitable decompositions it is possible to decompose a matrix $M$ appropriately associated with a given graph. The result is a collection of smaller matrices whose collective eigenvalues are the same as the eigenvalues…
In this note we give a short overview on symmetry exploiting techniques in three different branches of polyhedral computations: The representation conversion problem, integer linear programming and lattice point counting. We describe some…
We describe a provably complete algorithm for the generation of a tight, possibly exact superset of all combinatorially distinct simple n-facet polytopes in R^d, along with their graphs, f-vectors, and face lattices. The technique applies…
The aim of this paper is to study symmetries of linearly singular differential equations, namely, equations that can not be written in normal form because the derivatives are multiplied by a singular linear operator. The concept of…
By a classic result of Gessel, the exponential generating functions for $k$-regular graphs are D-finite. Using Gr\"obner bases in Weyl algebras, we compute the linear differential equations satisfied by the generating function for 5-, 6-,…
In this paper we present a set of results on the integration and on the symmetries of the lattice potential Korteweg-de Vries (lpKdV) equation. Using its associated spectral problem we construct the soliton solutions and the Lax technique…
We show how to exploit symmetries of a graph to efficiently compute the fastest mixing Markov chain on the graph (i.e., find the transition probabilities on the edges to minimize the second-largest eigenvalue modulus of the transition…
Markov chain Monte Carlo methods explicitly defined on the manifold of probability distributions have recently been established. These methods are constructed from diffusions across the manifold and the solution of the equations describing…
In the present paper, we present some numerical methods for computing approximate solutions to some large differential linear matrix equations. In the first part of this work, we deal with differential generalized Sylvester matrix equations…
We study countably monotone and Markov interval maps. We establish sufficient conditions for uniqueness of a conjugate map of constant slope. We explain how global window perturbation can be used to generate a large class of maps satisfying…
Knowing the symmetries of a polyhedron can be very useful for the analysis of its structure as well as for practical polyhedral computations. In this note, we study symmetry groups preserving the linear, projective and combinatorial…
We present a new automated method for finding integrable symplectic maps of the plane. These dynamical systems possess a hidden symmetry associated with an existence of conserved quantities, i.e. integrals of motion. The core idea of the…
We present a fast Jacobi-like algorithm for computing the eigenvalues, and optionally the eigenvectors, of a real normal matrix. The method gains a computational advantage by using Paardekooper's method for skew-symmetric matrices The…
In the complex setting, let $F(x,y,y')=0$ be an analytic or algebraic differential equation with $y'$-degree $d$. We deal with the qualitative study of such equations through the geometry of the planar $d$-web generated by the generic…
Let Gamma be a congruence subgroup of the Picard modular group of an imaginary number field k, and let D be the associated symmetric space. We describe a method to compute the integral cohomology of the locally symmetric space Gamma\D. The…
In a recent paper [TMP, 200:1 (2019), 966--984] by the authors, a series of integrable discrete autonomous equations on a square lattice with a non-standard structure of generalized symmetries is constructed. We build modified series by…
We describe a simple algorithm based on a Markov chain process to generate simply connected acyclic directed graphs over a fixed set of vertices. This algorithm is an extension of a previous one, designed to generate acyclic digraphs, non…
We present a new algorithm which is named the Dynamical Functional Particle Method, DFPM. It is based on the idea of formulating a finite dimensional damped dynamical system whose stationary points are the solution to the original…