Related papers: Eichler orders, quotient graphs and random walks
In this paper, we define the quotinet graphs. In particular, we introduce the boundary quotient graphs, admissible boundary quotient graphs and subgraph boundary qoutient graphs. By the property of the quotient spaces, the boundary…
The modelling of interconnection networks by graphs motivated the study of several extremal problems that involve well known parameters of a graph (degree, diameter, girth and order) and ask for the optimal value of one of them while…
In this paper the family of elliptic curves over \Q given by the equation E_{p}: Y^2=(X-p)^3+X^3+(X+p)^3 where p is a prime number, is studied. It is shown that the maximal rank of the elliptic curves is at most 3 and some conditions under…
We investigate the average rank in the family of quadratic twists of a given elliptic curve defined over $\mathbb{Q}$, when the curves are ordered using the canonical height of their lowest non-torsion rational point.
We prove a strong relation between Chern and log Chern invariants of algebraic surfaces. For a given arrangement of curves, we find nonsingular projective surfaces with Chern ratio arbitrarily close to the log Chern ratio of the log surface…
In this paper, we consider the GIT quotients of Schubert varieties for the action of a maximal torus. We describe the minuscule Schubert varieties for which the semistable locus is contained in the smooth locus. As a consequence, we study…
Using an Euclidean approach, we prove a new upper bound for the number of closed points of degree 2 on a smooth absolutely irreducible projective algebraic curve defined over the finite field $\mathbb F\_q$.This bound enables us to provide…
Let $\mathcal{E}$ be a $\mathbb{Q}$-isogeny class of elliptic curves defined over $\mathbb{Q}$. The isogeny graph associated to $\mathcal{E}$ is a graph which has a vertex for each element of $\mathcal{E}$ and an edge for each…
Graph states and their entanglement properties are pivotal for the development of quantum computing and technologies. For qubits, local complementation, a graphical rule that connects all the equivalent states under Local Clifford (LC)…
Given a curve X of the form y^p = h(x) over a number field, one can use descents to obtain explicit bounds on the Mordell-Weil rank of the Jacobian or to prove that the curve has no rational points. We show how, having performed such a…
For any number field not containing $\QQ(i),$ we give an explicit construction to prove that there exists an elliptic curve defined over this field such that its Shafarevich-Tate group is nontrivial.
This work is devoted to the study of representations of finite subgroups of the group of units of quaternion division algebras over a global or local field arising from the inclusion via extension of scalars splitting the algebra. Following…
In this paper, we describe an algorithm that, for a smooth connected curve $X$ over a field $k$ with normal completion having arithmetic genus $p_a(X)$, a finite locally constant sheaf $\mathcal A$ on $X_{et}$ of abelian groups of torsion…
In this article, we present a method for computing rational points on hyperelliptic curves of genus~3 and isolated quadratic points on hyperelliptic curves of genus~2 and~3 whose Jacobians have rank~0. Our approach begins by computing the…
The theory of {\Gamma}-species is developed to allow species-theoretic study of quotient structures in a categorically rigorous fashion. This new approach is then applied to two graph-enumeration problems which were previously unsolved in…
The parity conjecture has a long and distinguished history. It gives a way of predicting the existence of points of infinite order on elliptic curves without having to construct them, and is responsible for a wide range of unexplained…
In this work we explore the structure of the branching graph of the unitary group using Schur transitions. We find that these transitions suggest a new combinatorial expression for counting paths in the branching graph. This formula, which…
In this paper we count all the subpaths of a given graph G; including the subpaths of length zero, and we call this quantity the subpath number of G. The subpath number is related to the extensively studied number of subtrees, as it can be…
Tree-width is an invaluable tool for computational problems on graphs. But often one would like to compute on other kinds of objects (e.g. decorated graphs or even algebraic structures) where there is no known tree-width analogue. Here we…
Previous results on genera g of F_{q^2}-maximal curves are improved: (1) Either g\leq (q^2-q+4)/6, or g=\lfloor(q-1)^2/4\rfloor, or g=q(q-1)/2; (2) The hypothesis on the existence of a particular Weierstrass point in \cite{at} is proved;…