SearcharxivSearch

arXiv subjects

Cyrus Hettle

Publications and source records attributed to Cyrus Hettle.

10 recordsLinked to original sources

Mathematically Quantifying Non-responsiveness of the 2021 Georgia Congressional Districting Plan

To audit political district maps for partisan gerrymandering, one may determine a baseline for the expected distribution of partisan outcomes by sampling an ensemble of maps. One approach to sampling is to use redistricting policy as a guide to precisely codify preferences between maps. Such preferences give rise to a probability distribution on the space of redistricting plans, and Metropolis-Hastings methods allow one to sample ensembles of maps from the specified distribution. Although these approaches have nice theoretical properties and have successfully detected gerrymandering in legal settings, sampling from commonly-used policy-driven distributions is often computationally difficult. As of yet, there is no algorithm that can be used off-the-shelf for checking maps under generic redistricting criteria. In this work, we mitigate the computational challenges in a Metropolized-sampling technique through a parallel tempering method combined with ReCom[12] and, for the first time, validate that such techniques are effective on these problems at the scale of statewide precinct graphs for more policy informed measures. We develop these improvements through the first case study of district plans in Georgia. Our analysis projects that any election in Georgia will reliably elect 9 Republicans and 5 Democrats under the enacted plan. This result is largely fixed even as public opinion shifts toward either party and the partisan outcome of the enacted plan does not respond to the will of the people. Only 0.12% of the $\sim$160K plans in our ensemble were similarly non-responsive.

cs.CY

Fair and Reliable Reconnections for Temporary Disruptions in Electric Distribution Networks using Submodularity

Increasing reliability and reducing disruptions in supply networks are of increasing importance; for example, power outages in electricity distribution networks cost \$35-50 billion annually in the US. Motivated by the operational constraints of such networks and their rapid adoption of decentralized paradigms and self-healing components, we introduce the "minimum reconnection time" (MRT) problem. MRT seeks to reduce outage time after network disruptions by programming reconnection times of different edges (i.e., switches), while ensuring that the operating network is acyclic. We show that MRT is NP-hard and is a special case of the well-known minimum linear ordering problem (MLOP) in the submodular optimization literature. MLOP is a special case of a broader class of ordering problems that often admit polynomial time approximation algorithms. We develop the theory of kernel-based randomized rounding approaches to give a tight polynomial-time approximation for MRT, improving the state-of-the-art approximation factor for a broad class of MLOP instances. Further, motivated by the reliability incentive structure for utility companies and operational energy losses in distribution networks, we propose local search over spanning trees to balance multiple objectives simultaneously. We computationally validate our reconfiguration methods on the NREL SMART-DS Greensboro synthetic network, and show that this improves service equity by a factor of four, across industrial and residential areas.

math.OC

Balanced Districting on Grid Graphs with Provable Compactness and Contiguity

Given a graph $G = (V,E)$ with vertex weights $w(v)$ and a desired number of parts $k$, the goal in graph partitioning problems is to partition the vertex set V into parts $V_1,\ldots,V_k$. Metrics for compactness, contiguity, and balance of the parts $V_i$ are frequent objectives, with much existing literature focusing on compactness and balance. Revisiting an old method known as striping, we give the first polynomial-time algorithms with guaranteed contiguity and provable bicriteria approximations for compactness and balance for planar grid graphs. We consider several types of graph partitioning, including when vertex weights vary smoothly or are stochastic, reflecting concerns in various real-world instances. We show significant improvements in experiments for balancing workloads for the fire department and reducing over-policing using 911 call data from South Fulton, GA.

cs.DS

Enumerating Parking Completions Using Join and Split

Given a strictly increasing sequence $\mathbf{t}$ with entries from $[n]:=\{1,\ldots,n\}$, a parking completion is a sequence $\mathbf{c}$ with $|\mathbf{t}|+|\mathbf{c}|=n$ and $|\{t\in \mathbf{t}\mid t\le i\}|+|\{c\in \mathbf{c}\mid c\le i\}|\ge i$ for all $i$ in $[n]$. We can think of $\mathbf{t}$ as a list of spots already taken in a street with $n$ parking spots and $\mathbf{c}$ as a list of parking preferences where the $i$-th car attempts to park in the $c_i$-th spot and if not available then proceeds up the street to find the next available spot, if any. A parking completion corresponds to a set of preferences $\mathbf{c}$ where all cars park. We relate parking completions to enumerating restricted lattice paths and give formulas for both the ordered and unordered variations of the problem by use of a pair of operations termed \textbf{Join} and \textbf{Split}. Our results give a new volume formula for most Pitman-Stanley polytopes, and enumerate the signature parking functions of Ceballos and Gonz\'alez D'Le\'on.

math.CO

A positivity phenomenon in Elser's Gaussian-cluster percolation model

Veit Elser proposed a random graph model for percolation in which physical dimension appears as a parameter. Studying this model combinatorially leads naturally to the consideration of numerical graph invariants which we call \emph{Elser numbers} $\mathsf{els}_k(G)$, where $G$ is a connected graph and $k$ a nonnegative integer. Elser had proven that $\mathsf{els}_1(G)=0$ for all $G$. By interpreting the Elser numbers as Euler characteristics of appropriate simplicial complexes called \emph{nucleus complexes}, we prove that for all graphs $G$, they are nonpositive when $k=0$ and nonnegative for $k\geq2$. The last result confirms a conjecture of Elser. Furthermore, we give necessary and sufficient conditions, in terms of the 2-connected structure of~$G$, for the nonvanishing of the Elser numbers.

math.CO

On the genus of a quotient of a numerical semigroup

We find a relation between the genus of a quotient of a numerical semigroup $S$ and the genus of $S$ itself. We use this identity to compute the genus of a quotient of $S$ when $S$ has embedding dimension $2$. We also exhibit identities relating the Frobenius numbers and the genus of quotients of numerical semigroups that are generated by certain types of arithmetic progressions.

math.NT

Box polynomials and the excedance matrix

We consider properties of the box polynomials, a one variable polynomial defined over all integer partitions $\lambda$ whose Young diagrams fit in an $m$ by $n$ box. We show that these polynomials can be expressed by the finite difference operator applied to the power $x^{m+n}$. Evaluating box polynomials yields a variety of identities involving set partition enumeration. We extend the latter identities using restricted growth words and a new operator called the fast Fourier operator, and consider connections between set partition enumeration and the chromatic polynomial on graphs. We also give connections between the box polynomials and the excedance matrix, which encodes combinatorial data from a noncommutative quotient algebra motivated by the recurrence for the excedance set statistic on permutations.

math.CO

Flag Descents and Eulerian Polynomials for Wreath Product Quotients

We investigate the $\alpha$-colored Eulerian polynomials and a notion of descents introduced in a recent paper of Hedmark and show that such polynomials can be computed as a polynomial encoding descents computed over a quotient of the wreath product $\mathbb{Z}_\alpha\wr\mathfrak{S}_n$. Moreover, we consider the flag descent statistic computed over this same quotient and find that the flag Eulerian polynomial remains palindromic. We prove that the flag descent polynomial is palindromic over this same quotient by giving a combinatorial proof that the flag descent statistic is symmetrically distributed over the collection of colored permutations with fixed last color by way of a new combinatorial tool, the colored winding number of a colored permutation. We conclude with some conjectures, observations, and open questions.

math.CO

Universal Partial Words over Non-Binary Alphabets

Chen, Kitaev, M\"{u}tze, and Sun recently introduced the notion of universal partial words, a generalization of universal words and de Bruijn sequences. Universal partial words allow for a wild-card character $\diamond$, which is a placeholder for any letter in the alphabet. We settle and strengthen conjectures posed in the same paper where this notion was introduced. For non-binary alphabets, we show that universal partial words have periodic $\diamond$ structure and are cyclic, and we give number-theoretic conditions on the existence of universal partial words. In addition, we provide an explicit construction for a family of universal partial words over alphabets of even size.

math.CO

Al-Jabar: A Mathematical Game of Strategy

We detail the rules and mathematical structure of Al-Jabar, a game invented by the authors based on intuitive concepts of color-mixing and ideas from abstract algebra. Game-play consists of manipulating colored game pieces; we discuss how these colored pieces form a group structure and how this structure, along with an operation used to combine the pieces, is used to create a game of strategy. We also consider extensions of the game rules to other group structures. Note: While this is an article for general readership originally published online by Gathering for Gardner in honor of Martin Gardner's birthday (Oct. 2011), Al-Jabar has been played in university abstract algebra courses as a teaching tool, as well as by game enthusiasts, since its release. Moreover, the algebraic game structure described has sparked further work by other mathematicians and game designers. Thus, we submit this article to the ArXiV as a resource for educators as well as those interested in mathematical games.

math.HO