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

We consider two questions on the geometry of Lipschitz free $p$-spaces $\mathcal F_p$, where $0<p\leq 1$, over subsets of finite-dimensional vector spaces. We solve an open problem and show that if $(\mathcal M, \rho)$ is an infinite…

Let $L$ be the Euclidean functional with $p$-th power-weighted edges. Examples include the sum of the $p$-th power-weighted lengths of the edges in minimal spanning trees, traveling salesman tours, and minimal matchings. Motivated by the…

We consider the problem of computing an $(s,d)$-hypernetwork in an acyclic F-hypergraph. This is a fundamental computational problem arising in directed hypergraphs, and is a foundational step in tackling problems of reachability and…

Let $\mathcal{H}$ be a hypergraph with $n$ vertices. Suppose that $d_1,d_2,\ldots,d_n$ are degrees of the vertices of $\mathcal{H}$. The $t$-th graph entropy based on degrees of $\mathcal{H}$ is defined as $$ I_d^t(\mathcal{H})…

Let E/Q be an elliptic curve and p a rational prime of good ordinary reduction. For every imaginary quadratic field K/Q satisfying the Heegner hypothesis for E we have a corresponding line in E(K)\otimes Q_p, known as a shadow line. When…

We obtain upper bounds (in most cases, sharp) for the hitting times of random walks on finite undirected graphs expressed as functions of the graph's number of edges. In particular, we show that the maximum hitting time for a simple random…

We consider the problem of determining the inducibility (maximum possible asymptotic density of induced copies) of oriented graphs on four vertices. We provide exact values for more than half of the graphs, and very close lower and upper…

Let $M_d$ be the moduli space of one-dimensional complex polynomial dynamical systems. The escape rates of the critical points determine a critical heights map $G: M_d \to \mathbb{R}^{d-1}$. For generic values of $G$, each connected…

Given an elliptic curve $E$ and a positive integer $N$, we consider the problem of counting the number of primes $p$ for which the reduction of $E$ modulo $p$ possesses exactly $N$ points over $\mathbb F_p$. On average (over a family of…

We show that under the 1:2:3 scaling, critically probing large space and time, the height function of finite range asymmetric exclusion processes and the KPZ equation converge to the KPZ fixed point, constructed earlier as a limit of the…

For a graph $G$, let $f(G)$ denote the size of the maximum cut in $G$. The problem of estimating $f(G)$ as a function of the number of vertices and edges of $G$ has a long history and was extensively studied in the last fifty years. In this…

We prove asymptotic formulas for the number of rational points of bounded height on smooth equivariant compactifications of the affine space. (Nous \'etablissons un d\'eveloppement asymptotique du nombre de points rationnels de hauteur…

Let $K$ be a number field, $\OK$ be its ring of integers. We introduce the notion of compactified representation of $GL_N(\OK)$ and, we see how to associate to a hermitian vector bundle $\E$ over $\Spec(\OK)$ and a compactified…

In this note we give an overview of various quantities that are used to measure the complexity of an algebraic dynamical system f:X-->X, including the dynamical degree d(f), which gives a coarse measure of the geometric complexity of the…

A \emph{matching} is a subset of edges in a graph $G$ that do not share an endpoint. A matching $M$ is a \emph{$\mathcal{P}$-matching} if the subgraph of $G$ induced by the endpoints of the edges of $M$ satisfies property $\mathcal{P}$. For…

In this paper we study the following problem. Let $A$ be a fixed graph, and let $\hom(G,A)$ denote the number of homomorphisms from a graph $G$ to $A$. Furthermore, let $v(G)$ denote the number of vertices of $G$, and let $\mathcal{G}_d$…

Let $Q^d$ be the $d$-dimensional binary hypercube. We say that $P=\{v_1,\ldots, v_k\}$ is an increasing path of length $k-1$ in $Q^d$, if for every $i\in [k-1]$ the edge $v_iv_{i+1}$ is obtained by switching some zero coordinate in $v_i$ to…

We obtain several lower bounds on the $\textsf{Max-Cut}$ of $d$-degenerate $H$-free graphs. Let $f(m,d,H)$ denote the smallest $\textsf{Max-Cut}$ of an $H$-free $d$-degenerate graph on $m$ edges. We show that $f(m,d,K_r)\ge…

Given asymptotic counts in number theory, a question of Venkatesh asks what is the topological nature of lower order terms. We consider the arithmetic aspect of the inertia stack of an algebraic stack over finite fields to partially answer…

Bhawalkar, Kleinberg, Lewi, Roughgarden, and Sharma [ICALP 2012] introduced the Anchored k-Core problem, where the task is for a given graph G and integers b, k, and p to find an induced subgraph H with at least p vertices (the core) such…