arXiv subjects
Publications and source records attributed to Caleb Ji.
A partial answer is given to a question raised by Kov\'acs and Taji in arxiv:2307.07192, namely that the relative Du Bois complex of a family parametrized by a non-singular curve commutes with base change to a general point on the base. It is also shown that this property usually fails for special points.
Given a smooth proper morphism $f\colon X\rightarrow S$, we introduce a certain derived category where morphisms are permitted to be $\mathcal{O}_S$-linear differential operators. We then prove a generalisation of Serre duality that applies to two-term complexes of this type. We apply this to give a new proof of Poincar\'e duality for relative algebraic de Rham cohomology.
The Shafarevich conjecture for a class of varieties over a number field posits the finitude of those with good reduction outside a finite set of primes. In the case of hypersurfaces in the torus $\mathbb{G}_m^n$, a natural class to consider are those with a fixed Newton polyhedron that are nondegenerate with respect to it. Using an approach similar to that of Lawrence-Sawin for abelian varieties (arXiv:2004.09046), we prove the Shafarevich conjecture for certain classes of Newton polyhedra. In the course of our proof we construct a fiber functor for the Tannakian category of perverse sheaves on the torus in positive characteristic and compute the weights of the Frobenius on it, which leads to the big monodromy results which are key to this method.
Let $S$ be a finite set of primes. For sufficiently large $n$ and $d$, Lawrence and Venkatesh proved that in the moduli space of hypersurfaces of degree $d$ in $\mathbb{P}^n$, the locus of points with good reduction outside $S$ is not Zariski dense. We make this result effective by computing explicit values of $n$ and $d$ for which this statement holds. We accomplish this by giving a more precise computation and analysis of the Hodge numbers of these hypersurfaces and check that they satisfy certain bounds.
We determine the Brauer group of the Deligne-Mumford stack $\mathscr{Y}_0(2)$, the moduli space of elliptic curves with a marked $2$-torsion subgroup over bases of arithmetic interest. Antieau and Meier determine the Brauer group for $\mathscr{M}_{1,1}$, the moduli stack of elliptic curves by exploiting the fact it is covered by the Legendre family and using the Hochschild-Serre spectral sequence. Over an algebraically closed field, Shin uses the coarse space map to determine the Brauer group of $\mathscr{M}_{1,1}$. We combine techniques from both papers to determine the Brauer group of $\mathscr{Y}_0(2)$.
Grothendieck proposed a theory of regular polyhedra over finite fields in Section 4 of \textit{Esquisse d'un Programme}. He isolates certain key parameters from the automorphism groups of regular polyhedra, which can be extended to any genus and specialized to various rings. In this note we give an interpretation of his sketched theory which explains some of his observations. We are able to compute some explicit examples and address a question Grothendieck raised about them in connection to dessins d'enfants. Finally, we highlight some of Grothendieck's observations which remain unexplained by our current approach.
Given a finite word $w$ over a finite alphabet $V$, consider the graph with vertex set $V$ and with an edge between two elements of $V$ if and only if the two elements alternate in the word $w$. Such a graph is said to be word-representable or 11-representable by the word $w$; this latter terminology arises from the phenomenon that the condition of two elements $x$ and $y$ alternating in a word $w$ is the same as the condition of the subword of $w$ induced by $x$ and $y$ avoiding the pattern 11. In this paper, we first study minimal length words which word-represent graphs, giving an explicit formula for both the length and the number of such words in the case of trees and cycles. We then extend the notion of word-representability (or 11-representability) of graphs to $t$-representability of graphs, for any pattern $t$ on two letters. We prove that every graph is $t$-representable for any pattern $t$ on two letters (except for possibly one class of $t$). Finally, we pose a few open problems for future consideration.
We consider Hessenberg varieties in the flag variety of $GL_n(\mathbb{C})$ with the property that the corresponding Hessenberg function defines an ad-nilpotent ideal. Each such Hessenberg variety is contained in a Springer fiber. We extend a theorem of Tymoczko to this setting, showing that these varieties have an affine paving obtained by intersecting with Schubert cells. Our method of proof constructs an an affine paving for each Springer fiber that restricts to an affine paving of the Hessenberg variety. We use the combinatorial properties of this paving to prove that Hessenberg varieties of this kind are connected.
We study the prime numbers that lie in Beatty sequences of the form $\lfloor \alpha n + \beta \rfloor$ and have prescribed algebraic splitting conditions. We prove that the density of primes in both a fixed Beatty sequence and a Chebotarev class of some Galois extension is precisely the product of the densities $\alpha^{-1}\cdot\frac{|C|}{|G|}$. Moreover, we show that the primes in the intersection of these sets satisfy a Bombieri--Vinogradov type theorem. This allows us to prove the existence of bounded gaps for such primes. As a final application, we prove a common generalization of the aforementioned bounded gaps result and the Green--Tao theorem.
We study tree-indexed random walks as introduced by Benjamini, H\"aggstr\"om, and Mossel, i.e. labelings of a tree for which adjacent vertices have labels differing by 1. It is a conjecture of those authors that the distribution of the range for any such tree is dominated by that of a path on the same number of edges. The two main variants of this conjecture considered in the literature are the $\textit{standard}$ walks, in which adjacent vertices must have labels differing by $\textit{exactly}$ 1, and $\textit{lazy}$ walks, in which adjacent vertices must have labels differing by $\textit{at most}$ 1. We confirm this conjecture for all trees in the lazy case and provide some partial results in the standard case.
The distinguishing number of a graph was introduced by Albertson and Collins as a measure of the amount of symmetry contained in the graph. Tymoczko extended this definition to faithful group actions on sets; taking the set to be the vertex set of a graph and the group to be the automorphism group of the graph allows one to recover the previous definition. Since then, several authors have studied properties of the distinguishing number as well as extensions of the notion. In this paper, we first answer a few open questions regarding the distinguishing number. Next we turn to generalizations regarding the labeling of Cartesian powers of a set and the different subgroups that can be obtained through labelings. We then introduce a new partially ordered set on partitions that follows naturally from extending the theory of distinguishing numbers to that of distinguishing partitions. Then we investigate the groups obtainable from partitioning Cartesian powers of a set in more detail and show how the original notion of the distinguishing number of a graph can be recovered in this way. Next, we introduce a polynomial and a symmetric function generalization of the distinguishing number. Finally, we present a large number of open questions and problems for further research.
We consider a variant of the game of Brussels Sprouts that, like Conway's original version, ends in a predetermined number of moves. We show that the endstates of the game are in natural bijection with noncrossing trees and that the game histories are in natural bijection with both parking functions and factorizations of a cycle of $S_n$.
The cyclic sieving phenomenon is a well-studied occurrence in combinatorics appearing when a cyclic group acts on a finite set. In this paper, we demonstrate a natural extension of this theory to finite abelian groups. We also present a similar result for dihedral groups and suggest approaches for natural generalizations to nonabelian groups.
It is a long-standing question of Stanley whether or not the chromatic symmetric function (CSF) distinguishes unrooted trees. Previously, the best computational result, due to Russell, proved that it distinguishes all trees with at most $25$ vertices. In this paper, we present a novel probabilistic algorithm which may be used to check more efficiently that the CSF distinguishes a set of trees. Applying it, we verify that the CSF distinguishes all trees with up to $29$ vertices.
In this paper, we consider a game beginning with a multiset of elements from a group. On a move, two elements are replaced by their sum. This is a no strategy game, and can be modeled as a graded poset with the rank of a node equal to the cardinality of its multiset. We study the enumerative properties of certain variations of this game, such as the number of ways to play them and their numbers of end states. This leads to several new sequences, as well as new interpretations of classic sequences such as those found in the Catalan and Motzkin triangles.
In this paper, we consider a game played on a rectangular $m \times n$ gridded chocolate bar. Each move, a player breaks the bar along a grid line. Each move after that consists of taking any piece of chocolate and breaking it again along existing grid lines, until just $mn$ individual squares remain. This paper enumerates the number of ways to break an $m \times n$ bar, which we call chocolate numbers, and introduces four new sequences related to these numbers. Using various techniques, we prove interesting divisibility results regarding these sequences.