Related papers: Relating Edelman-Greene insertion to the Little ma…

We review the relationship between discrete groups of symmetries of Euclidean three-space, constructions in algebraic geometry around Kleinian singularities including versions of Hilbert and Quot schemes, and their relationship to…

It is shown that the problem of reduction can be formulated in a uniform way using the theory of invariants. This provides a powerful tool of analysis and it opens the road to new applications of these algebras, beyond the context of…

In this article I describe my recent geometric localization argument dealing with actions of NONcompact groups which provides a geometric bridge between two entirely different character formulas for reductive Lie groups and answers the…

Restrictions of incidence-preserving path maps produce an oriented hypergraphic All Minors Matrix-tree Theorems for Laplacian and adjacency matrices. The images of these maps produce a locally signed graphic, incidence generalization, of…

It is shown that each integrable mapping is connected with a hierarchical completely integrable sytem of equations of evolution type which are invariant with respect to the transformation described by this mapping.

The infinite series of logarithmic minimal models LM(1,p) is considered in the W-extended picture where they are denoted by WLM(1,p). As in the rational models, the fusion algebra of WLM(1,p) is described by a simple graph fusion algebra.…

For various purposes and, in particular, in the context of data compression, a graph can be examined at three levels. Its structure can be described as the unlabeled version of the graph; then the labeling of its structure can be added; and…

Lie symmetry analysis is one of the powerful tools to analyze nonlinear ordinary differential equations. We review the effectiveness of this method in terms of various symmetries. We present the method of deriving Lie point symmetries,…

We prove local convergence results for the uniformly random, labelled or unlabelled, graphs from subcritical families. As an example special case, we prove Benjamini-Schramm convergence for the uniform random unlabelled tree. We introduce a…

We shall prove a convergence result relative to sequences of Minkowski symmetrals of general compact sets. In particular, we investigate the case when this process is induced by sequences of subspaces whose elements belong to a finite…

Splint is a decomposition of root system into union of root systems. Splint of root system for simple Lie algebra appears naturally in studies of (regular) embeddings of reductive subalgebras. Splint can be used to construct branching…

In a previous paper of one of us [Europhys. Lett. 59 (2002), 330--336] the validity of Greene's method for determining the critical constant of the standard map (SM) was questioned on the basis of some numerical findings. Here we come back…

We complete Dyson's dream by cementing the links between symmetric spaces and classical random matrix ensembles. Previous work has focused on a one-to-one correspondence between symmetric spaces and many but not all of the classical random…

The Stanley-Stembridge conjecture associates a symmetric function to each natural unit interval order $\mathcal P$. In this paper, we define relations \`a la Knuth on the symmetric group for each $\mathcal P$ and conjecture that the…

We present a distributed anytime algorithm for performing MAP inference in graphical models. The problem is formulated as a linear programming relaxation over the edges of a graph. The resulting program has a constraint structure that…

In this work we obtain the general form of polynomial mappings that commute with a linear action of a relative symmetry group. The aim is to give results for relative equivariant polynomials that correspond to the results for relative…

We first prove an identity involving symmetric polynomials. This identity leads us into exploring the geometry of Lagrangian Grassmannians. As an insight applications, we obtain a formula for the integral over the Lagrangian Grassmannian of…

We consider the problem of approximating an affinely structured matrix, for example a Hankel matrix, by a low-rank matrix with the same structure. This problem occurs in system identification, signal processing and computer algebra, among…

We present a general framework connecting global symmetries to the relativistic $S$-matrix through the lens of quantum information theory. Analyzing the 2-to-2 scattering of particles of any helicity, we systematically characterize…

Geometric modeling by constraints leads to large systems of algebraic equations. This paper studies bipartite graphs underlaid by systems of equations. It shows how these graphs make possible to polynomially decompose these systems into…