Related papers: Counting fixed points free vector fields on $\math…
We determine the maximum number of rational points on a curve over $\mathbb{F}_2$ with fixed gonality and small genus.
In this paper, we give several asymptotic formulas for the number of multiplicatively dependent vectors of algebraic numbers of fixed degree, or within a fixed number field, and bounded height.
In this paper, we give a full description of all possible singular points that occur in generic 2-parameter families of vector fields on compact 2-manifolds. This is a part of a large project aimed to a complete study of global bifurcations…
In a graph whose vertices are assigned integer ranks, a path is well-ranked if the endpoints have distinct ranks or some interior point has a higher rank than the endpoints. A ranking is an assignment of ranks such that all nontrivial paths…
We consider the problem of devising algorithms to count exactly the number of independent sets of a graph G . We show that there is a polynomial time algorithm for this problem when G is restricted to the class of strongly orderable graphs,…
It is well known that an $N$-parameter $d$-dimensional Brownian sheet has no $k$-multiple points when $(k-1)d>2kN$, and does have such points when $(k-1)d<2kN$. We complete the study of the existence of $k$-multiple points by showing that…
The problem of finding upper bounds for minimal vertex number of graphs with a given automorphism group is addressed in this article for the case of cyclic $2$-groups. We show that for any natural $n\ge 2$ there is an undirected graph…
A fixed-mobile bigraph G is a bipartite graph such that the vertices of one partition set are given with fixed positions in the plane and the mobile vertices of the other part, together with the edges, must be added to the drawing. We…
The purpose of this paper is to give explicit methods for bounding the number of vertices of finite $k$-regular graphs with given second eigenvalue. Let $X$ be a finite $k$-regular graph and $\mu_1(X)$ the second largest eigenvalue of its…
We study combinatorial configurations with the associated point and line graphs being strongly regular. Examples not belonging to known classes such as partial geometries and their generalizations or elliptic semiplanes are constructed.…
In this paper, two-to-one mappings and involutions without any fixed point on finite fields of even characteristic are investigated. First, we characterize a closed relationship between them by implicit functions and develop an AGW-like…
The notion of a Riordan graph was introduced recently, and it is a far-reaching generalization of the well-known Pascal graphs and Toeplitz graphs. However, apart from a certain subclass of Toeplitz graphs, nothing was known on independent…
Explicit expressions are considered for the generating functions concerning the number of planar diagrams with given numbers of 3- and 4-point vertices. It is observed that planar renormalization theory requires diagrams with restrictions,…
We compute the number of points over finite fields of some algebraic varieties related to cluster algebras of finite type. More precisely, these varieties are the fibers of the projection map from the cluster variety to the affine space of…
For polynomials and rational maps of fixed degree over a finite field, we bound both the average number of connected components of their functional graphs as well as the average number of periodic points of their associated dynamical…
Let $G=\mathbf{Z}_{p} \oplus \mathbf{Z}_{p^2}$, where $p$ is a prime number. Suppose that $d$ is a divisor of the order of $G$. In this paper we find the number of automorphisms of $G$ fixing $d$ elements of $G$, and denote it by…
It is a longstanding conjecture that every simple drawing of a complete graph on $n \geq 3$ vertices contains a crossing-free Hamiltonian cycle. We strengthen this conjecture to "there exists a crossing-free Hamiltonian path between each…
Our main result states that every fixed-point free continuous self-map of ${\mathbb R}^{n}$ is colorable. This result can be re-formulated as follows: A continuous map $f: {\mathbb R}^{n}\to {\mathbb R}^{n}$ is fixed-point free iff…
We consider $\mathcal{A}$-finite map germs $f$ from $(\mathbb{C}^n,0)$ to $(\mathbb{C}^{2n},0)$. First, we show that the number of double points that appears in a stabilization of $f$, denoted by $d(f)$, can be calculated as the length of…
We discuss the problem of embedding graphs in the plane with restrictions on the vertex mapping. In particular, we introduce a technique for drawing planar graphs with a fixed vertex mapping that bounds the number of times edges bend. An…