Related papers: Counting fixed points free vector fields on $\math…
We consider an infinite-dimensional non-linear operator related to a hard core (HC) model with a countable set $\mathbb{N}$ of spin values. It is known that finding the fixed points of an infinite-dimensional operator is generally…
Theorems on the existence of vector fields with given sets of Indexes of isolated Singular points are proved for the cases of closed manifolds, pairs of manifolds, manifolds with boundary, and gradient fields. It is proved that, on a…
A connected graph is 2K2-free if it does not contain a pair of independent edges as an induced subgraph. In this paper, we present the structural characterization of minimal vertex separator and show that there are polynomial number of…
An independent vertex set of a graph is a set of vertices of the graph in which no two vertices are adjacent, and a maximal independent set is one that is not a proper subset of any other independent set. In this paper we count the number…
A graph whose vertices are points in the plane and whose edges are noncrossing straight-line segments of unit length is called a \emph{matchstick graph}. We prove two somewhat counterintuitive results concerning the maximum number of edges…
Consider an analytical function $f:V\subset\mathbb R^2\rightarrow\mathbb R$ having $0$ as its regular value, a switching manifold $\Sigma=f^{-1}(0)$ and a piecewise analytical vector field $X=(X^+,X^-)$, i.e. $X^\pm$ are analytical vector…
The question of defining unique, generally applicable constrained second, and higher-order, derivatives is investigated. It is shown that second-order constrained derivatives obtained via two successive constrained differentiations provide…
In this paper, we discuss automorphism related parameters of a graph associated to a finite vector space. The fixing neighborhood of a pair $(u,v)$ of vertices of a graph $G$ is the set of all those vertices $w$ of $G$, such that the orbits…
We study the spectra of operators on periodic graphs using methods from combinatorial algebraic geometry. Our main result is a bound on the number of complex critical points of the Bloch variety, together with an effective criterion for…
We determine the number of labelled chordal planar graphs with $n$ vertices, which is asymptotically $c_1\cdot n^{-5/2} \gamma^n n!$ for a constant $c_1>0$ and $\gamma \approx 11.89235$. We also determine the number of rooted simple chordal…
Mixtures of $r$ independent distributions for two discrete random variables can be represented by matrices of nonnegative rank $r$. Likelihood inference for the model of such joint distributions leads to problems in real algebraic geometry…
A graph $G$ is called a $2K_2$-free graph if it does not contain $2K_2$ as an induced subgraph. In 2014, Broersma, Patel and Pyatkin showed that every 25-tough $2K_2$-free graph on at least three vertices is Hamiltonian. Recently, Shan…
We consider all genus 2 curves over Q given by an equation y^2 = f(x) with f a squarefree polynomial of degree 5 or 6, with integral coefficients of absolute value at most 3. For each of these roughly 200000 isomorphism classes of curves,…
We study biplane graphs drawn on a finite planar point set $S$ in general position. This is the family of geometric graphs whose vertex set is $S$ and can be decomposed into two plane graphs. We show that two maximal biplane graphs---in the…
In 2015, Steinerberger showed that the number of legal chess diagrams without promotion is bounded from above by $2\times 10^{40}$. This number was obtained by restricting both bishops and pawns position and by a precise bound when no…
A graph has strong convex dimension $2$, if it admits a straight-line drawing in the plane such that its vertices are in convex position and the midpoints of its edges are also in convex position. Halman, Onn, and Rothblum conjectured that…
We introduce methods to count and enumerate all maximal independent, all maximum independent sets, and all independent sets in threshold graphs and k-threshold graphs. Within threshold graphs and k-threshold graphs independent sets…
We prove a dynamical Shafarevich theorem on the finiteness of the set of isomorphism classes of rational maps with fixed degeneracies. More precisely, fix an integer d at least 2 and let K be either a number field or the function field of a…
There has been interest recently in maximizing the number of independent sets in graphs. For example, the Kahn-Zhao theorem gives an upper bound on the number of independent sets in a $d$-regular graph. Similarly, it is a corollary of the…
We investigate the open Closing Lemma problem for vector fields on the 2-dimensional torus. Under the assumption of bounded type rotation number, the $C^r$ Closing Lemma is verified for smooth vector fields that are area-preserving at all…