Related papers: Children's Drawings and the Riemann-Hilbert Proble…

A fundamental problem from invariant theory is to describe the endomorphism algebra of multilinear functions on a representation V invariant under the action of a group G. According to Weyl's classic, a first main (later: fundamental)…

This paper introduces a novel approach to data analysis designed for the needs of specialists in psychology of religion. We detect developmental and cross-cultural patterns in children's drawings of God(s) and other supernatural agents. We…

This thesis deals with three different aspects of the combinatorics of permutations. In the first two papers, two flavours of pattern avoiding permutations are examined; and in the third paper Young tableaux, which are closely related to…

We introduce new times in the monodromy preserving equations. While the usual times related to the moduli of complex structures of Riemann curves such as coordinates of marked points, we consider the moduli of generalized complex structures…

We construct the ordinary irreducible representations of the group of automorphisms of a finite rooted tree and we get a natural parametrization of them. To achieve this goals, we introduce and study the combinatorics of tree compositions,…

The inverse problem of diffraction theory in essence amounts to the reconstruction of the atomic positions of a solid from its diffraction image. From a mathematical perspective, this is a notoriously difficult problem, even in the…

In this article we consider combinatorial maps approach to graphs on surfaces, and how between them can be establish terminological uniformity in favor of combinatorial maps in way rotations are set as base structural elements and all other…

Explicit solutions to the Riemann-Hilbert problem will be found realising some irreducible non-rigid local systems. The relation to isomonodromy and the sixth Painleve equation will be described. Keywords: Riemann-Hilbert problem, Painleve…

Learning in Riemannian orbifolds is motivated by existing machine learning algorithms that directly operate on finite combinatorial structures such as point patterns, trees, and graphs. These methods, however, lack statistical…

Riemann surfaces with nodes can be described by introducing simple composite operators in matrix models. In the case of the Kontsevich model, it is sufficient to add the quadratic, but ``non-propagating'', term (tr[X])^2 to the Lagrangian.…

We study two long-standing conjectures concerning lower bounds for the Betti numbers of a graded module over a polynomial ring. We prove new cases of these conjectures in codimensions five and six by reframing the conjectures as arithmetic…

Consider a rational map from a projective space to a product of projective spaces, induced by a collection of linear projections. Motivated by the the theory of limit linear series and Abel-Jacobi maps, we study the basic properties of the…

The moduli spaces of compact and connected Riemann surfaces has been a central topic in modern mathematics in recent years. Thus their homological dimensions become important invariants. Motivated by the emergence mathematical counterparts…

We study a class of complex polynomial equations on a finite graph with a view to understanding how holistic phenomena emerge from combinatorial structure. Particular solutions arise from orthogonal projections of regular polytopes,…

A consequence of the results of Bers and Griffiths on the uniformization of complex algebraic varieties is that the universal cover of a family of Riemann surfaces, with base and fibers of finite hyperbolic type, is a contractible…

A Keller map is a counterexample to the Jacobian Conjecture. In dimension two every such map, if exists, leads to a complicated set of conditions on the map between the Picard groups of suitable compactifications of the affine plane. This…

We prove a complexity dichotomy theorem for Holant Problems on 3-regular graphs with an arbitrary complex-valued edge function. Three new techniques are introduced: (1) higher dimensional iterations in interpolation; (2) Eigenvalue Shifted…

A coset geometry representation of regular dessins is established, and employed to describe quotients and coverings of regular dessins and surfaces. A characterization is then given of face-quasiprimitive regular dessins as coverings of…

We propose a new family of combinatorial inference problems for graphical models. Unlike classical statistical inference where the main interest is point estimation or parameter testing, combinatorial inference aims at testing the global…

The generalized partially linear models on Riemannian manifolds are introduced. These models, like ordinary generalized linear models, are a generalization of partially linear models on Riemannian manifolds that allow for response variables…