Related papers: Galois points for a finite graph
Let $X$ be a smooth hypersurface $X$ of degree $d\geq4$ in a projective space $\mathbb P^{n+1}$. We consider a projection of $X$ from $p\in\mathbb P^{n+1}$ to a plane $H\cong\mathbb P^n$. This projection induces an extension of function…
In this paper, a function on any pair of graphs is defined whose properties are similar to the properties of dot product in vector space. This function enables us to define graph orthogonality and, also, a new metric on isomorphism classes…
We investigate the interplay between linear systems on curves and graphs in the context of specialization of divisors on an arithmetic surface. We also provide some applications of our results to graph theory, arithmetic geometry, and…
We show how rational points on certain varieties parametrize phenomena arising in the Galois theory of iterates of quadratic polynomials. As an example, we characterize completely the set of quadratic polynomials $x^2+c$ whose third iterate…
A new algebraic Cayley graph is constructed using finite fields. Its connectedness and diameter bound are studied via Weil's estimate for character sums. These graphs provide a new source of expander graphs, extending classical results of…
We study some versions of the statement of Hadwiger's conjecture for finite as well as infinite graphs.
We define a covering of a profinite graph to be a projective limit of a system of covering maps of finite graphs. With this notion of covering, we develop a covering theory for profinite graphs which is in many ways analogous to the…
We study the arithmetic of Galois-invariant sets of points on algebraic curves with controlled reduction behavior. Let $C$ be a smooth projective curve with a smooth proper model $\mathcal{C}$ over $\mathcal{O}_{K,S}$. We define $\Omega_n$…
On a metric graph we introduce the notion of a free divisor as a replacement for the notion of a base point free complete linear system on a curve. By means of an example we show that the Clifford inequality is the only obstruction for the…
We give bounds for exponential sums over curves defined over Galois rings. We first define summation subsets as the images of lifts of points from affine opens of the reduced curve, and we give bounds for the degrees of their coordinate…
A point $P$ in projective space is said to be Galois with respect to a hypersurface if the function field extension induced by the projection from $P$ is Galois. We present a hyperplane section theorem for Galois points. Precisely, if $P$…
A new complete invariant for acyclic graphs is presented
We study Galois points for a hypersurface $X$ with $\dim {\rm Sing}(X) \le \dim X-2$. The purpose of this article is to determine the set $\Delta(X)$ of Galois points in characteristic zero: Indeed, we give a sharp upper bound of the number…
The interplay between groups and graphs have been the most famous and productive area of algebraic graph theory. In this paper, we introduce and study the graphs whose vertex set is group G such that two distinct vertices a and b having…
We generalize the idea of cofinite groups, due to B. Hartley. First we define cofinite spaces in general. Then, as a special situation, we study cofinite graphs and their uniform completions. The idea of constructing a cofinite graph starts…
A self-contained exposition is given of the topological and Galois-theoretic properties of the category of combinatorial 1-complexes, or graphs, very much in the spirit of Stallings. A number of classical, as well as some new results about…
The purpose of this paper is to constructively develop a Galois theory on irreducible shifts of finite type (SFTs) and to analyze the automorphism groups of SFTs using this framework. Let $X$ and $Y$ be irreducible SFTs. We demonstrate that…
We show how the size of the Galois groups of iterates of a quadratic polynomial $f(x)$ can be parametrized by certain rational points on the curves $C_n:y^2=f^n(x)$ and their quadratic twists. To that end, we study the arithmetic of such…
In this paper we introduce a novel polynomial-time algorithm to compute graph invariants based on the modified random walk idea on graphs. However not proved to be a full graph invariant by now, our method gives the right answer for the…
In this paper we introduced an arithmetic graph function which associates with every group G the directed graph whose vertices corresponds to the divisors of |G|. With the help of such functions we introduced arithmetic graphs of classes of…