SearcharxivSearch

arXiv subjects

Everett Sullivan

Publications and source records attributed to Everett Sullivan.

5 recordsLinked to original sources

Extremal Chowla sets and their linear analogues: A human-AI mathematical investigation using Co-Scientist

We introduce an extremal invariant associated with Chowla-type order conditions in finite groups. A nonempty subset $S$ of a finite group $G$ is called a Chowla set if every element of $S$ has order greater than $|S|$, and we write $C(G)$ for the maximum cardinality of such a set. We first show that $C(G)$ is determined by the distribution of element orders in $G$. For cyclic groups, we derive an exact divisor formula and characterize the integers $n$ for which $C(\mathbb{Z}/n\mathbb{Z})=\varphi(n)$. We prove that $\liminf_{n\to\infty}C(\mathbb{Z}/n\mathbb{Z})/\varphi(n)=1$, whereas $\limsup_{n\to\infty}C(\mathbb{Z}/n\mathbb{Z})/\varphi(n)=\infty$, and we determine the corresponding lower and upper limits under normalization by $n$. For finite abelian groups, we obtain an explicit formula in terms of the invariant-factor decomposition, together with a closed formula for finite abelian $p$-groups. We then develop a linear analogue for finite field extensions. A nonzero $K$-subspace $A$ of an extension $L/K$ is called a Chowla subspace if $[K(a):K]>\dim_K A$ for every nonzero $a\in A$. Since this condition depends on $\dim_K A$, it does not generally require every nonzero element of $A$ to generate $L$ over $K$. Nevertheless, when $L/K$ is finite and separable, we prove the exact formula $C(L/K)=[L:K]-d_{\max}(L/K)$, where $d_{\max}(L/K)$ is the largest degree over $K$ of a proper intermediate field. For finite fields, we give a direct proof in every degree using a normal-basis construction. This work was developed through an expert-guided human-AI collaboration. A reasoning-focused configuration of Co-Scientist was used to explore examples and potential proof strategies. The authors formulated the problem, independently verified and completed all arguments, and wrote the final proofs.

math.NT

Danceability, A New Definition of Bridge Index

There are many commonly known definitions of the bridge index coming from combinatorial knot theory, Morse theory, geometry, and algebra. In this paper, we prove that the danceability index is a new equivalent definition of the bridge index which can be seen as an oriented version of the Wirtinger number. We extend the danceability invariant to virtual knots in multiple ways and compare these invariants to two different notions of bridge index for virtual knots.

math.GT

Exactly-solvable self-trapping lattice walks. II. Lattices of arbitrary height

A growing self-avoiding walk (GSAW) is a walk on a graph that is directed, does not visit the same vertex twice, and has a trapped endpoint. We show that the generating function enumerating GSAWs on a half-infinite strip of finite height is rational, and we give a procedure to construct a combinatorial finite state machine that allows one to compute this generating function. We then modify this procedure to compute generating functions for GSAWs under two probabilistic models. We perform Monte Carlo simulations to estimate the expected length and displacement for GSAWs on the quarter plane, half plane, full plane, and half-infinite strips of bounded height for which we cannot compute the generating function. Finally, we prove that the generating functions for Greek key tours (GSAWs on a finite grid that visit every vertex) on a half-infinite strip of fixed height are also rational, allowing us to resolve several conjectures.

math.CO

Exactly-Solvable Self-Trapping Lattice Walks. Part I: Trapping in Ladder Graphs

A growing self-avoiding walk (GSAW) is a stochastic process that starts from the origin on a lattice and grows by occupying an unoccupied adjacent lattice site at random. A sufficiently long GSAW will reach a state in which all adjacent sites are already occupied by the walk and become trapped, terminating the process. It is known empirically from simulations that on a square lattice, this occurs after a mean of 71 steps. In Part I of a two-part series of manuscripts, we consider simplified lattice geometries only two sites high ("ladders") and derive generating functions for the probability distribution of GSAW trapping. We prove that a self-trapping walk on a square ladder will become trapped after a mean of 17 steps, while on a triangular ladder trapping will occur after a mean of 941/48 (~19.6 steps). We discuss additional implications of our results for understanding trapping in the "infinite" GSAW.

math.CO

Linear chord diagrams with long chords

A linear chord diagram of size $n$ is a partition of the set $\{1,2,\cdots,2n\}$ into sets of size two, called chords. From a table showing the number of linear chord diagrams of degree $n$ such that every chord has length at least $k$, we observe that if we proceed far enough along the diagonals, they are given by a geometric sequence. We prove that this holds for all diagonals, and identify when the effect starts.

math.CO