Related papers: Polynomial and analytic methods for classifying co…
Analytic perturbation theory for matrices and operators is an immensely useful mathematical technique. Most elementary introductions to this method have their background in the physics literature, and quantum mechanics in particular. In…
A graph $G$ is said to be an $(s, k)$-polar graph if its vertex set admits a partition $(A, B)$ such that $A$ and $B$ induce, respectively, a complete $s$-partite graph and the disjoint union of at most $k$ complete graphs. Polar graphs and…
The automorphisms of all 4-dimensional, real Lie Algebras are presented in a comprehensive way. Their action on the space of $4\times 4$, real, symmetric and positive definite, matrices, defines equivalence classes which are used for the…
We consider a new class of quaternionic mappings, associated with the spatial partial differential equations. We describe all mappings from this class using four analytic functions of the complex variable.
General factors are a generalization of matchings. Given a graph $G$ with a set $\pi(v)$ of feasible degrees, called a degree constraint, for each vertex $v$ of $G$, the general factor problem is to find a (spanning) subgraph $F$ of $G$…
We give a polynomial-time dynamic programming algorithm for solving the linear complementarity problem with tridiagonal or, more generally, Hessenberg P-matrices. We briefly review three known tractable matrix classes and show that none of…
Valiant introduced some 25 years ago an algebraic model of computation along with the complexity classes VP and VNP, which can be viewed as analogues of the classical classes P and NP. They are defined using non-uniform sequences of…
We study the problem of colouring visibility graphs of polygons. In particular, for visibility graphs of simple polygons, we provide a polynomial algorithm for 4-colouring, and prove that the 5-colourability question is already NP-complete…
Providing an abstract representation of natural and human complex structures is a challenging problem. Accounting for the system heterogenous components while allowing for analytical tractability is a difficult balance. Here I introduce…
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,…
We show NP-completeness for several planar variants of the monotone satisfiability problem with bounded variable appearances. With one exception the presented variants have an associated bipartite graph where the vertex degree is bounded by…
Universality theorems (in the sense of N. Mn\"{e}v) claim that the realization space of a combinatorial object (a point configuration, a hyperplane arrangement, a convex polytope, etc.) can be arbitrarily complicated. In the paper, we prove…
We consider a hierarchy of the natural type Hamiltonian systems of $n$ degrees of freedom with polynomial potentials separable in general ellipsoidal and general paraboloidal coordinates. We give a Lax representation in terms of $2\times 2$…
We examine ordered graphs, defined as graphs with linearly ordered vertices, from the perspective of homomorphisms (and colorings) and their complexities. We demonstrate the corresponding computational and parameterized complexities, along…
This dissertation presents new results on three different themes all related to matroid polytopes. First we investigate properties of Ehrhart polynomials of matroid polytopes, independence matroid polytopes, and polymatroids. We prove that…
We classify four-dimensional compact solvmanifolds up to diffeomorphism, while determining which of them have complex analytic structures. In particular, we shall see that a four-dimensional compact solvmanifold S can be written, up to…
For a graph $H$, a graph $G$ is an $H$-graph if it is an intersection graph of connected subgraphs of some subdivision of $H$. $H$-graphs naturally generalize several important graph classes like interval or circular-arc graph. This class…
We introduce a new cohomology theory for planar trivalent graphs with perfect matchings. The graded Euler characteristic of the cohomology is a one variable polynomial called the 2-factor polynomial that, if nonzero when evaluated at one,…
We present integral representations of solutions to division problems involving matrices of polynomials in several complex variables. We also find estimates of the polynomial degree of the solutions by means of careful degree estimates of…
In this paper, we investigate Hamiltonian path problem in the context of split graphs, and produce a dichotomy result on the complexity of the problem. Our main result is a deep investigation of the structure of $K_{1,4}$-free split graphs…