SearcharxivSearch

arXiv subjects

Jayden Thadani

Publications and source records attributed to Jayden Thadani.

2 recordsLinked to original sources

A family of accumulation points of non-free rational numbers

For any $q\in\mathbb{R}$, let $A:=\left(\begin{smallmatrix}1 & 1\\0 & 1\end{smallmatrix}\right), B_q:=\left(\begin{smallmatrix}1 & 0\\q & 1\end{smallmatrix}\right)$ and let $G_q:=\langle A,B_q\rangle\leqslant\operatorname{SL}(2,\mathbb{R})$. Kim and Koberda conjecture that for every $q\in\mathbb{Q}\cap(-4,4)$, the group $G_q$ is not freely generated by these two matrices. We generalize work of Smilga and construct families of $q$ satisfying the conjecture that accumulate at infinitely many different points in $(-4,4)$. We give different constructions of such families, the first coming from applying tools in Diophantine geometry to certain polynomials arising in Smilga's work, the second from sums of geometric series and the last from ratios of Pell and Half-Companion Pell Numbers accumulating at $1+\sqrt{2}$.

math.GR

Preference-restricted parking functions

A parking function is a function $π:[n]\to [n]$ whose $i$th-smallest output is at most $i,$ corresponding to a parking procedure for $n$ cars on a one-way street. We refine this concept by introducing preference-restricted parking functions, which are parking functions with codomain restricted to some $S\subseteq[n]$. Particular choices of $S$ yield new combinatorial interpretations of previous results about variant parking procedures, and new results too. In particular we consider prime parking functions, parking procedures with fewer spots than cars, and parking functions where each spot has space for multiple cars. We also use restricted parking functions to reprove Abel's binomial theorem.

math.CO