Related papers: Combinatorial decomposition theorem for Hitchin sy…
It is reviewed how Compton scattering sum rules relate low-energy nucleon structure quantities to the nucleon excitation spectrum. In particular, the GDH sum rule and recently proposed extensions of it will be discussed. These extensions…
We show that the matrix element of a local quark-gluon operator in the photon state, $<\gamma(k\lambda)|\hat O| \gamma(k\lambda)>$, can be calculated in lattice QCD. The result is generalized to other quantities involving space-like…
The lattice cohomology of a reduced curve singularity is a bigraded ${\mathbb Z}[U]$-module ${\mathbb H}^*=\oplus_{q,n}{\mathbb H}^q_{2n}$, that categorifies the $\delta$-invariant and extract key geometric information from the semigroup of…
We adapt Hitchin's integrable systems to the case of a punctured curve. In the case of $\CC P^{1}$ and $SL_{n}$-bundles, they are equivalent to systems studied by Garnier. The corresponding quantum systems were identified by B. Feigin, E.…
The general decomposition theory of exponential operators is briefly reviewed. A general scheme to construct independent determining equations for the relevant decomposition parameters is proposed using Lyndon words. Explicit formulas of…
In this PhD thesis, we give a new geometric approach to higher Teichm\"uller theory. In particular we construct a geometric structure on surfaces, generalizing the complex structure, and we explore its link to Hitchin components. The…
We consider the geometric quantisation of Chern--Simons theory for closed genus-one surfaces and semisimple complex groups. First we introduce the natural complexified analogue of the Hitchin connection in K\"{a}hler quantisation, with…
Gleason's theorem [A. Gleason, J. Math. Mech., \textbf{6}, 885 (1957)] is an important result in the foundations of quantum mechanics, where it justifies the Born rule as a mathematical consequence of the quantum formalism. Formally, it…
Functional decomposition is a powerful tool for systems analysis because it can reduce a function of arbitrary input dimensions to the sum and superposition of functions of a single variable, thereby mitigating (or potentially avoiding) the…
Within the Hamiltonian formulation of Lattice gauge theories, prepotentials, belonging to the fundamental representation of the gauge group and defined locally at each site of the lattice, enables us to construct local loop operators and…
Shephard (Canad. J. Math. 26: 302-321, 1974) proved a decomposition theorem for zonotopes yielding a simple formula for their volume. In this note we prove a generalization of this theorem yielding similar formulas for their intrinsic…
In this note we formulate and prove a version of Cartan decomposition for holomorphic loop groups, similar to Cartan decomposition for $p$-adic loop groups, discussed proved by Garland (and later by the authors by geometric mathods). The…
We establish the following splitter theorem for graphs and its generalization for matroids: Let $G$ and $H$ be $3$-connected simple graphs such that $G$ has an $H$-minor and $k:=|V(G)|-|V(H)|\ge 2$. Let $n:=\left\lceil k/2\right\rceil+1$.…
Consider the following classes of pairs consisting of a group and a finite collection of subgroups: $\mathcal{C}= \left\{ (G,\mathcal H) \mid \text{$\mathcal{H}$ is hyperbolically embedded in $G$} \right\}$ and $ \mathcal{D}= \left\{…
In this paper, a new general decomposition theory inspired from modular graph decomposition is presented. Our main result shows that, within this general theory, most of the nice algorithmic tools developed for modular decomposition are…
We study the combinatorics of hyperplane arrangements over arbitrary fields. Specifically, we determine in which situation an arrangement and its reduction modulo a prime number have isomorphic lattices via the use of minimal strong…
We discuss generalizations of some results on lattice polygons to certain piecewise linear loops which may have a self-intersection but have vertices in the lattice $\mathbb{Z}^2$. We first prove a formula on the rotation number of a…
Folding of ADE-Dynkin diagrams according to graph automorphisms yields irreducible Dynkin diagrams of ABCDEFG-types. This folding procedure allows to trace back the properties of the corresponding simple Lie algebras or groups to those of…
We study a class of generalized Chern-Simons equations on discrete lattice graphs. By an iterative scheme combined with an exhaustion argument, we establish the existence of topological solutions, which is also the maximal topological…
We locate gaps in the spectrum of a Hamiltonian on a periodic cuboidal (and generally hyperrectangular) lattice graph with $\delta$ couplings in the vertices. We formulate sufficient conditions under which the number of gaps is finite. As…