Related papers: Three arithmetic sites
We present four open conjectures in graph theory generated by the automated conjecturing system \texttt{TxGraffiti}. Each conjecture is concise, grounded in natural graph invariants, and empirically validated across hundreds of graphs.…
We define the bigraphical arrangement of a graph and show that the Pak-Stanley labels of its regions are the parking functions of a closely related graph, thus proving conjectures of Duval, Klivans, and Martin and of Hopkins and Perkinson.…
In [15], the algebraico-tree-theoretic simplicity hierarchical structure of J. H. Conway's ordered field No of surreal numbers was brought to the fore and employed to provide necessary and sufficient conditions for an ordered field to be…
We prove an analog of Belyi's theorem for the algebraic surfaces. Namely, any non-singular algebraic surface can be defined over a number field if and only it covers the complex projective plane with ramification at three knotted…
We present four new examples of plane rational curves with two Galois points in positive characteristic, and determine the number of Galois points for three of them. Our results are related to a problem on projective linear groups.
We present, to the best of the authors' knowledge, all known results for the (planar) crossing numbers of specific graphs and graph families. The results are separated into various categories; specifically, results for general graph…
In here, I present a series of combinatorial equalities derived using a graph based approach. Different nodes in the graphs are visited following probabilistic dynamics of a moving dot. The results are presented in such a way that the…
These notes explore three amazing formulas proved by Abel in his 1826 Paris memoir on what we now call Abelian integrals. We discuss the first two formulas from the point of view of symbolic computation and explain their connection to…
We work out details of the extrinsic geometry for two Hilbert schemes of some contemporary interest: the Hilbert scheme of two points on the projective plane and the dense open set parametrizing non-planar clusters in the punctual Hilbert…
Using some adaptations of the adjacency decomposition method \cite{CR} and the program {\it cdd} (~\cite{Fu}), we compute the first computationally difficult cases of convex cones of $m$-ary and oriented analogs of semi-metrics and cut…
We present a form of algebraic reasoning for computational objects which are expressed as graphs. Edges describe the flow of data between primitive operations which are represented by vertices. These graphs have an interface made of…
In Arakelov theory a completion of an arithmetic surface is achieved by enlarging the group of divisors by formal linear combinations of the ``closed fibers at infinity''. Manin described the dual graph of any such closed fiber in terms of…
We construct two bijections of the symmetric group S_n onto itself that enable us to show that three new three-variable statistics are equidistributed with classical statistics involving the number of fixed points. The first one is…
We describe a new algorithm for computing Whitney stratifications of complex projective varieties. The main ingredients are (a) an algebraic criterion, due to L\^e and Teissier, which reformulates Whitney regularity in terms of conormal…
Suppose that $f \colon X \dashrightarrow X$ is a dominant rational self-map of a smooth projective variety defined over ${\overline{\mathbf Q}}$. Kawaguchi and Silverman conjectured that if $P \in X({\overline{\mathbf Q}})$ is a point with…
We give a complete description of the normal subgroups of arboreal Galois groups of Belyi maps. The normal groups form a unique chief series. We also carefully compute the discriminate of the iterate of a polynomial minus an algebraic…
We prove two results on the algebraic dynamics of billiards in generic algebraic curves of degree $d \geq 2$. First, the dynamical degree grows quadratically in $d$; second, the set of complex periodic points has measure 0, implying the…
We consider the problem of computing the distance-dependent two-point function of general planar maps and hypermaps, i.e. the problem of counting such maps with two marked points at a prescribed distance. The maps considered here may have…
Delaunay triangulations of a point set in the Euclidean plane are ubiquitous in a number of computational sciences, including computational geometry. Delaunay triangulations are not well defined as soon as 4 or more points are concyclic but…
A new algorithm for computing a point on a polynomial or rational curve in B\'{e}zier form is proposed. The method has a geometric interpretation and uses only convex combinations of control points. The new algorithm's computational…