相关论文: Heights in finite projective space, and a problem …

We study the behavior of averages for functions defined on finite graphs $G$, in terms of the Hardy-Littlewood maximal operator $M_G$. We explore the relationship between the geometry of a graph and its maximal operator and prove that $M_G$…

We study a generalization of the Erd\H{o}s-Falconer distance problem over finite fields. For a graph $G$, two embeddings $p, p': V(G) \to \mathbb{F}_q^d$ of a graph $G$ are congruent if for all edges $(v_i, v_j)$ of $G$ we have that…

The radius and diameter are fundamental graph parameters. They are defined as the minimum and maximum of the eccentricities in a graph, respectively, where the eccentricity of a vertex is the largest distance from the vertex to another…

We consider the problem of estimating the graph size, where one is given only local access to the graph. We formally define a query model in which one starts with a \emph{seed} node and is allowed to make queries about neighbours of nodes…

Let $G = (V,E)$ be a connected directed graph on $n$ vertices. Assign values from the set $\{1,2,\dots,n\}$ to the vertices of $G$ and update the values according to the following rule: uniformly at random choose a vertex and update its…

The periodic points of a morphism of good reduction for a smooth projective curve with good reduction over the p-adics form a discrete set. This is used to give an interpretation of the morphic height in terms of asymptotic properties of…

Let $H$ be a Hilbert space and $H_1,...,H_n$ be closed subspaces of $H$. Set $H_0:=H_1\cap H_2\cap...\cap H_n$ and let $P_k$ be the orthogonal projection onto $H_k$, $k=0,1,...,n$. The paper is devoted to the study of functions…

We classify all finite-dimensional Hopf algebras over an algebraically closed field of characteristic zero such that its coradical is isomorphic to the algebra of functions over a dihedral group D_m, with m=4a> 11. We obtain this…

We investigate extremal problems for hypergraphs satisfying the following density condition. A $3$-uniform hypergraph $H=(V, E)$ is $(d, \eta,P_2)$-dense if for any two subsets of pairs $P$, $Q\subseteq V\times V$ the number of pairs…

We give a mathematical structure on an arithmetic surface, that has algebraic meanings over finite places and can estimate the canonical norm for a relative differential form on the arithmetic surface. This will give a lower bound for the…

Let K be an algebraic number field. For a degree d rational morphism of projective n-space defined over K let R denote its minimal resultant ideal. For a fixed height function on the moduli space of dynamical systems this paper shows that…

The problem of finding the longest simple cycle in a directed graph is NP-hard, with critical applications in computational biology, scheduling, and network analysis. Existing approaches include exact algorithms with exponential runtimes,…

To quantitatively characterize height distributions (HDs), one uses adimensional ratios of their first central moments ($m_n$) or cumulants ($\kappa_n$), especially the skewness $S$ and kurtosis $K$, whose accurate estimate demands an…

A graph homomorphism is a vertex map which carries edges from a source graph to edges in a target graph. The instances of the Weighted Maximum H-Colourable Subgraph problem (MAX H-COL) are edge-weighted graphs G and the objective is to find…

We prove asymptotic formulas for the number of rational points of bounded height on certain equivariant compactifications of the affine plane.

The diameter of a directed graph is the maximum distance between any pair of vertices. We study a problem that generalizes \textsc{Oriented Diameter}: For a given directed graph and a positive integer $d$, what is the minimum number of arc…

For $1<p<\infty$ and $M$ the centered Hardy-Littlewood maximal operator on $\mathbb{R}$, we consider whether there is some $\varepsilon=\varepsilon(p)>0$ such that $\|Mf\|_p\ge (1+\varepsilon)||f||_p$. We prove this for $1<p<2$. For $2\le…

Quadratic Chabauty is a $p$-adic method for determining rational points on curves. Local heights are arithmetic invariants used in the quadratic Chabauty method. We present an algorithm to compute these local heights for hyperelliptic…

Let $C$ be a smooth projective irreducible curve defined over a finite field $\mathbb{F}_q$ and $K=\mathbb{F}_q(C)$. Let $A\subset K$ be the ring of functions regular outside a fixed place $\infty$ of $K$. Let…

The paper focuses on two problems: (i) how to orient the edges of an undirected graph in order to maximize the number of ordered vertex pairs (x,y) such that there is a directed path from x to y, and (ii) how to orient the edges so as to…