SearcharxivSearch

arXiv subjects

Erik Insko

Publications and source records attributed to Erik Insko.

At least 19 recordsLinked to original sources

Limit Cases And Strategy In Chutes and Ladders

We analyze what happens to the average duration of a game of Chutes and Ladders as the probability of rolling $\delta \in \{ 1,2,3,4,5,6\}$ approaches 100%. We utilize Markov models, and Monte Carlo simulations in Python. We also introduce strategy to the board game by allowing the player to choose whether or not they flip a coin after each die roll where if they get heads they will advance one square and if they get tails they will go back one square. The strategy the player employs to decide when to flip the coin has a significant impact on the average duration of the game. We analyze six different non-trivial strategies.

math.GM

Partial permutohedra

Partial permutohedra are lattice polytopes which were recently introduced and studied by Heuer and Striker. For positive integers $m$ and $n$, the partial permutohedron $\mathcal{P}(m,n)$ is the convex hull of all vectors in $\{0,1,\ldots,n\}^m$ whose nonzero entries are distinct. We study the face lattice, volume and Ehrhart polynomial of $\mathcal{P}(m,n)$, and our methods and results include the following. For any $m$ and $n$, we obtain a bijection between the nonempty faces of $\mathcal{P}(m,n)$ and certain chains of subsets of $\{1,\dots,m\}$, thereby confirming a conjecture of Heuer and Striker, and we then use this characterization of faces to obtain a closed expression for the $h$-polynomial of $\mathcal{P}(m,n)$. For any $m$ and $n$ with $n\ge m-1$, we use a pyramidal subdivision of $\mathcal{P}(m,n)$ to establish a recursive formula for the normalized volume of $\mathcal{P}(m,n)$, from which we then obtain closed expressions for this volume. We also use a sculpting process (in which $\mathcal{P}(m,n)$ is reached by successively removing certain pieces from a simplex or hypercube) to obtain closed expressions for the Ehrhart polynomial of $\mathcal{P}(m,n)$ with arbitrary $m$ and fixed $n\le 3$, the normalized volume of $\mathcal{P}(m,4)$ with arbitrary $m$, and the Ehrhart polynomial of $\mathcal{P}(m,n)$ with fixed $m\le4$ and arbitrary $n\ge m-1$.

math.CO

Regular Hessenberg varieties for the minimal indecomposable Hessenberg space

This paper investigates the geometry of regular Hessenberg varieties associated with the minimal indecomposable Hessenberg space in the flag variety of a complex reductive group. These varieties form a flat family of irreducible subvarieties of the flag variety, encompassing notable examples such as the Peterson variety and toric varieties linked to Weyl chambers. Our first main result computes the closures of affine cells that pave these varieties explicitly, establishing a correspondence between Hessenberg--Schubert varieties and regular Hessenberg varieties in smaller dimensional flag varieties. We also analyze the singular locus of these varieties, proving that all regular Hessenberg varieties are singular outside of the toric case. Specifically, we extend previous results on the singular locus of the Peterson variety to all Lie types. Additionally, we provide detailed descriptions of Hessenberg--Schubert variety inclusion relations, a combinatorial characterization of smooth Hessenberg--Schubert varieties, and simple formulas for their $K$-theory and cohomology classes. The paper also includes a classification of all singular permutation flags in each regular Hessenberg variety in type A, linking them to combinatorial patterns, and generalizes these findings using root-theoretic data to all Lie types.

math.AG

Tipsy cop and tipsy robber: collisions of biased random walks on graphs

Introduced by Harris, Insko, Prieto Langarica, Stoisavljevic, and Sullivan, the \emph{tipsy cop and drunken robber} is a variant of the cop and robber game on graphs in which the robber simply moves randomly along the graph, while the cop moves directed towards the robber some fixed proportion of the time and randomly the remainder. In this article, we adopt a slightly different interpretation of tipsiness of the cop and robber where we assume that in any round of the game there are four possible outcomes: a sober cop move, a sober robber move, a tipsy (uniformly random) move by the cop, and a tipsy (uniformly random) move by the robber. We study this tipsy cop and tipsy robber game on the infinite grid graph and on certain families of infinite trees including $δ$-regular trees %infinite binary trees with an infinite path rooted at every vertex, and $δ$-regular trees rooted to a $Δ$-regular tree, where $Δ\geq δ$. Our main results analyze strategies for the cop and robber on these graphs. We conclude with some directions for further study.

math.PR

On singularity and normality of regular nilpotent Hessenberg varieties

Regular nilpotent Hessenberg varieties form an important family of subvarieties of the flag variety, which are often singular and sometimes not normal varieties. Like Schubert varieties, they contain distinguished points called permutation flags. In this paper, we give a combinatorial characterization for a permutation flag of a regular nilpotent Hessenberg variety to be a singular point. We also apply this result to characterize regular nilpotent Hessenberg varieties which are normal algebraic varieties.

math.AG

A combinatorial model for lane merging

A two lane road approaches a stoplight. The left lane merges into the right just past the intersection. Vehicles approach the intersection one at a time, with some drivers always choosing the right lane, while others always choose the shorter lane, giving preference to the right lane to break ties. An arrival sequence of vehicles can be represented as a binary string, where the zeros represent drivers always choosing the right lane, and the ones represent drivers choosing the shorter lane. From each arrival sequence we construct a merging path, which is a lattice path determined by the lane chosen by each car. We give closed formulas for the number of merging paths reaching the point $(n,m)$ with exactly $k$ zeros in the arrival sequence, and the expected length of the right lane for all arrival sequences with exactly $k$ zeros. Proofs involve an adaptation of Andre's Reflection Principle. Other interesting connections also emerge, including to: Ballot numbers, the expected maximum number of heads or tails appearing in a sequence of $n$ coin flips, the largest domino snake that can be made using pieces up to $[n:n]$, and the longest trail on the complete graph $K_n$ with loops.

math.CO

On $(t,r)$ broadcast domination of directed graphs

A dominating set of a graph $G$ is a set of vertices that contains at least one endpoint of every edge on the graph. The domination number of $G$ is the order of a minimum dominating set of $G$. The $(t,r)$ broadcast domination is a generalization of domination in which a set of broadcasting vertices emits signals of strength $t$ that decrease by 1 as they traverse each edge, and we require that every vertex in the graph receives a cumulative signal of at least $r$ from its set of broadcasting neighbors. In this paper, we extend the study of $(t,r)$ broadcast domination to directed graphs. Our main result explores the interval of values obtained by considering the directed $(t,r)$ broadcast domination numbers of all orientations of a graph $G$. In particular, we prove that in the cases $r=1$ and $(t,r) = (2,2)$, for every integer value in this interval, there exists an orientation $\vec{G}$ of $G$ which has directed $(t,r)$ broadcast domination number equal to that value. We also investigate directed $(t,r)$ broadcast domination on the finite grid graph, the star graph, the infinite grid graph, and the infinite triangular lattice graph. We conclude with some directions for future study.

math.CO

Markov models for the tipsy cop and robber game on graphs

In this paper we analyze and model three open problems posed by Harris, Insko, Prieto-Langarica, Stoisavljevic, and Sullivan in 2020 concerning the tipsy cop and robber game on graphs. The three different scenarios we model account for different biological scenarios. The first scenario is when the cop and robber have a consistent tipsiness level though the duration of the game; the second is when the cop and robber sober up as a function of time; the third is when the cop and robber sober up as a function of the distance between them. Using Markov chains to model each scenario we calculate the probability of a game persisting through $\mathbf{M}$ rounds of the game and the expected game length given different starting positions and tipsiness levels for the cop and robber.

math.CO

Tipsy cop and drunken robber: a variant of the cop and robber game on graphs

Motivated by a biological scenario illustrated in the YouTube video \url{ https://www.youtube.com/watch?v=Z_mXDvZQ6dU} where a neutrophil chases a bacteria cell moving in random directions, we present a variant of the cop and robber game on graphs called the tipsy cop and drunken robber game. In this game, we place a tipsy cop and a drunken robber at different vertices of a finite connected graph $G$. The game consists of independent moves where the robber begins the game by moving to an adjacent vertex from where he began, this is then followed by the cop moving to an adjacent vertex from where she began. Since the robber is inebriated, he takes random walks on the graph, while the cop being tipsy means that her movements are sometimes random and sometimes intentional. Our main results give formulas for the probability that the robber is still free from capture after $m$ moves of this game on highly symmetric graphs, such as the complete graphs, complete bipartite graphs, and cycle graphs. We also give the expected encounter time between the cop and robber for these families of graphs. We end the manuscript by presenting a general method for computing such probabilities and also detail a variety of directions for future research.

math.CO

A formula for enumerating permutations with a fixed pinnacle set

In 2017 Davis, Nelson, Petersen, and Tenner pioneered the study of pinnacle sets of permutations and asked whether there exists a class of operations, which applied to a permutation in $\mathfrak{S}_n$, can produce any other permutation with the same pinnacle set and no others. In this paper, we adapt a group action defined by Foata and Strehl to provide a way to generate all permutations with a given pinnacle set. From this we give a closed non-recursive formula enumerating permutations with a given pinnacle set. Thus answering a question posed by Davis, Nelson, Petersen, and Tenner.

math.CO

A formula for the cohomology and $K$-class of a regular Hessenberg variety

Hessenberg varieties are subvarieties of the flag variety parametrized by a linear operator $X$ and a nondecreasing function $h$. The family of Hessenberg varieties for regular $X$ is particularly important: they are used in quantum cohomology, in combinatorial and geometric representation theory, in Schubert calculus and affine Schubert calculus. We show that the classes of a regular Hessenberg variety in the cohomology and $K$-theory of the flag variety are given by making certain substitutions in the Schubert polynomial (respectively Grothendieck polynomial) for a permutation that depends only on $h$. Our formula and our methods are different from a recent result of Abe, Fujita, and Zeng that gives the class of a regular Hessenberg variety with more restrictions on $h$ than here.

math.AG

Kostant's Weight Multiplicity Formula and the Fibonacci and Lucas Numbers

Consider the weight $λ$ which is the sum of all simple roots of a simple Lie algebra. Using Kostant's weight multiplicity formula we describe and enumerate the contributing terms to the multiplicity of the zero weight in the representation with highest weight $λ$. We prove that in Lie algebras of type $A$ and $B$, the number of contributing terms to the multiplicity of the zero-weight space in the representation with highest weight $λ$ is given by a Fibonacci number, and that in Lie algebras of type $C$ and $D$, the analogous result is given by a multiple of a Lucas number.

math.RT

A Variant on the Feline Josephus Problem

In the Feline Josephus problem, soldiers stand in a circle, each having $\ell$ `lives'. Going around the circle, a life is taken from every $k$th soldier; soldiers with 0 lives remaining are removed from the circle. Finding the last surviving soldier proves to be an interesting and difficult problem, even in the case when $\ell=1$. In our variant of the Feline Josephus problem, we instead remove a life from $k$ consecutive soldiers, and skip 1 soldier. In certain cases, we find closed formulas for the surviving soldier and hint at a way of finding such solutions in other cases.

math.CO

Descent polynomials

Let $n$ be a nonnegative integer and $I$ be a finite set of positive integers. In 1915, MacMahon proved that the number of permutations in the symmetric group $\mathfrak{S}_n$ with descent set $I$ is a polynomial in $n$. We call this the descent polynomial. However, basic properties of these polynomials such as a description of their coefficients and roots do not seem to have been studied in the literature. Much more recently, in 2013, Billey, Burdzy, and Sagan showed that the number of elements of $\mathfrak{S}_n$ with peak set $I$ is a polynomial in $n$ times a certain power of two. Since then, there have been a flurry of papers investigating properties of this peak polynomial. The purpose of the present paper is to study the descent polynomial. We will see that it displays some interesting parallels with its peak relative. Conjectures and questions for future research are scattered throughout.

math.CO

Computing weight $q$-multiplicities for the representations of the simple Lie algebras

The multiplicity of a weight $μ$ in an irreducible representation of a simple Lie algebra $\mathfrak{g}$ with highest weight $λ$ can be computed via the use of Kostant's weight multiplicity formula. This formula is an alternating sum over the Weyl group and involves the computation of a partition function. In this paper we consider a $q$-analog of Kostant's weight multiplicity and present a SageMath program to compute $q$-multiplicities for the simple Lie algebras.

math.RT

The singular locus of semisimple Hessenberg varieties

Although regular semisimple Hessenberg varieties are smooth and irreducible, semisimple Hessenberg varieties are not necessarily smooth in general. In this paper we determine the irreducible components of semisimple Hessenberg varieties corresponding to the standard Hessenberg space. We prove that these irreducible components are smooth and give an explicit description of their intersections, which constitute the singular locus. We conclude with an example of a semisimple Hessenberg variety corresponding to another Hessenberg space which is singular and irreducible, showing that results of this nature do not hold for all semisimple Hessenberg varieties.

math.AG

Peaks on Graphs

Given a graph $G$ with $n$ vertices and a bijective labeling of the vertices using the integers $1,2,\ldots, n$, we say $G$ has a peak at vertex $v$ if the degree of $v$ is greater than or equal to 2, and if the label on $v$ is larger than the label of all its neighbors. Fix an enumeration of the vertices of $G$ as $v_1,v_2,\ldots, v_{n}$ and a fix a set $S\subset V(G)$. We want to determine the number of distinct bijective labelings of the vertices of $G$, such that the vertices in $S$ are precisely the peaks of $G$. The set $S$ is called the \emph{peak set of the graph} $G$, and the set of all labelings with peak set $S$ is denoted by $\PSG$. This definition generalizes the study of peak sets of permutations, as that work is the special case of $G$ being the path graph on $n$ vertices. In this paper, we present an algorithm for constructing all of the bijective labelings in $\PSG$ for any $S\subseteq V(G)$. We also explore peak sets in certain families of graphs, including cycle graphs and joins of graphs.

math.CO

Upper broadcast domination of toroidal grids and a classification of diametrical trees

A broadcast on a graph $G=(V,E)$ is a function $f:V \rightarrow \{0,1, \ldots, \text{diam}(G)\}$ satisfying $f(v) \leq e(v)$ for all $v \in V$, where $e(v)$ denotes the eccentricity of $v$ and $\text{diam}(G)$ denotes the diameter of $G$. We say that a broadcast dominates $G$ if every vertex can hear at least one broadcasting node. The upper domination number is the maximum cost of all possible minimal broadcasts, where the cost of a broadcast is defined as $\text{cost} (f)= \sum_{v \in V}f(v)$. In this paper we establish both the upper domination number and the upper broadcast domination number on toroidal grids. In addition, we classify all diametrical trees, that is, trees whose upper domination number is equal to its diameter.

math.CO