Related papers: Lowener Theory on Analytic Universal Covering Maps
We show that the notion of generalized Lenard chains naturally allows formulation of the theory of multi-separable and superintegrable systems in the context of bi-Hamiltonian geometry. We prove that the existence of generalized Lenard…
In this paper we introduce a model theoretic construction for the theories of uniform layered domains and semifields introduced in the paper of Izhakian, Knebusch and Rowen. We prove that, for a given layering semiring L, the theory of…
We investigate the relationship between the univalence of $f$ and of $h$ in the decomposition $f=h+\bar{g}$ of a sense-preserving harmonic mapping defined in the unit disk $\mathbb{D}\subset\mathbb{C}$. Among other results, we determine the…
In this paper, we focus on the study of immanantal polynomials for linear combination matrices composed of the degree matrix and adjacency matrix of a graph. First, applying the concept of vertex orientation for general graphs, we provide a…
Bidimensionality is the most common technique to design subexponential-time parameterized algorithms on special classes of graphs, particularly planar graphs. The core engine behind it is a combinatorial lemma of Robertson, Seymour and…
The first half of this paper is largely expository, wherein we present a systematic combinatorial approach to the theory of polynomial (semi)invariants and multilinear invariants of several vectors and covectors, for the classical groups.…
Let $G$ be a graph and $f: G\rightarrow G$ be a continuous map. We establish a structure theorem which describes the structures of the set $R(f)-\overline{P(f)}$, where $R(f)$ and $P(f)$ are the recurrent point set and the periodic point…
We analyze a model for the homotopy theory of complete filtered $L_\infty$-algebras intended for applications in algebraic and algebro-geometric deformation theory. We provide an explicit proof of an unpublished result of E.\ Getzler which…
Leighton's Graph Covering Theorem states that if two finite graphs have the same universal covering tree, then they also have a common finite degree cover. Bass and Kulkarni gave an alternative proof of this fact using tree lattices. We…
A decomposition of a graph is a set of subgraphs whose edges partition those of $G$. The 3-decomposition conjecture posed by Hoffmann-Ostenhof in 2011 states that every connected cubic graph can be decomposed into a spanning tree, a…
Counting homomorphisms from a graph $H$ into another graph $G$ is a fundamental problem of (parameterized) counting complexity theory. In this work, we study the case where \emph{both} graphs $H$ and $G$ stem from given classes of graphs:…
For a fixed finite collection of graphs ${\cal F}$, the ${\cal F}$-M-DELETION problem asks, given an $n$-vertex input graph $G,$ for the minimum number of vertices that intersect all minor models in $G$ of the graphs in ${\cal F}$. by…
The Loewner equation is known as a one-dimensional reduction of the Benney chain as well as the dispersionless KP hierarchy. We propose a reverse process showing that time splitting in the Loewner or the Loewner-Kufarev equation leads to…
In this note we continue our study of unidirectional solutions to hydrodynamic Euler alignment systems with strongly singular communication kernels $\phi(x):=|x|^{-(n+\alpha)}$ for $\alpha\in(0,2)$. Here, we consider the critical case…
We give a geometric proof to the classical fact that the dimension of the deformations of a given generic Fuchsian equation without changing the semi-simple conjugacy class of its local monodromies (``number of accessory parameters'') is…
We prove a structure theorem for the Gromov-Witten invariants of compact Kahler surfaces with geometric genus $p_g>0$. Under the technical assumption that there is a canonical divisor that is a disjoint union of smooth components, the…
We develop a family of simple rank one theories built over quite arbitrary sequences of finite hypergraphs. (This extends an idea from the recent proof that Keisler's order has continuum many classes, however, the construction does not…
We generalise Hinich's Theorem of descent of Deligne groupoids to the case where the dgLas involved have no negative cohomology. We apply this result to study the infinitesimal deformations of a morphism $\alpha: {\mathcal F} \to {\mathcal…
It has recently been observed by Zuiddam that finite graphs form a preordered commutative semiring under the graph homomorphism preorder together with join and disjunctive product as addition and multiplication, respectively. This led to a…
The Loewner framework is one of the most successful data-driven model order reduction techniques. If $N$ is the cardinality of a given data set, the so-called Loewner and shifted Loewner matrices $\mathbb{L}\in\mathbb{C}^{N\times N}$ and…