Search arXivSearch

arXiv · 2210.05748

Critical Points at Infinity for Hyperplanes of Directions

Abstract

Analytic combinatorics in several variables (ACSV) analyzes the asymptotic growth of the coefficients of a meromorphic generating function $F = G/H$ in a direction $\mathbf{r}$. It uses Morse theory on the pole variety $V := \{ H = 0 \} \subseteq (\mathbb{C}^*)^d$ of $F$ to deform the torus $T$ in the multivariate Cauchy Integral Formula via the downward gradient flow for the \textit{height} function $h = h_{\mathbf{r}} = -\sum_{j=1}^d r_j \log |z_j|$, giving a homology decomposition of $T$ into cycles around \textit{critical points} of $h$ on $V$. The deformation can flow to infinity at finite height when the height function is not a proper map. This happens only in the presence of a critical point at infinity (CPAI): a sequence of points on $V$ approaching a point at infinity, and such that log-normals to $V$ converge projectively to $\mathbf{r}$. The CPAI is called \textit{heighted} if the height function also converges to a finite value. This paper studies whether all CPAI are heighted, and in which directions CPAI can occur. We study these questions by examining sequences converging to faces of a toric compactification defined by a multiple of the Newton polytope $\mathcal{P}$ of the polynomial $H$. Under generically satisfied conditions, any projective limit of log-normals of a sequence converging to a face $F$ must be parallel to $F$; this implies that CPAI must always be heighted and can only occur in directions parallel to some face of $\mathcal{P}$. When this generic condition fails, we show under a smoothness condition, that a point in a codimension-1 face $F$ can still only be a CPAI for directions parallel to $F$, and that the directions for a codimension-2 face can be a larger set, which can be computed explicitly and still has positive codimension.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Stephen Gillen. 2022-10-11. Critical Points at Infinity for Hyperplanes of Directions. https://arxiv.org/abs/2210.05748

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO