Searcharxiv⌕ Search

arXiv subjects

Carolyn Chun

Publications and source records attributed to Carolyn Chun.

At least 19 recordsLinked to original sources
arXiv2025

Rainbow triangles and the Erdős-Hajnal problem in projective geometries

We formulate a geometric version of the Erdős-Hajnal conjecture that applies to finite projective geometries rather than graphs, in both its usual 'induced' form and the multicoloured form. The multicoloured conjecture states, roughly, that a colouring $c$ of the points of $\mathsf{PG}(n-1,q)$ containing no copy of a fixed colouring $c_0$ of $\mathsf{PG}(k-1,q)$ for small $k$ must contain a subspace of dimension polynomial in $n$ that avoids some colour. If $(k,q) = (2,2)$, then $c_0$ is a colouring of a three-element 'triangle', and there are three essentially different cases, all of which we resolve. We derive both the cases where $c_0$ assigns the same colour to two different elements from a recent breakthrough result in additive combinatorics due to Kelley and Meka. We handle the case that $c_0$ is a 'rainbow' colouring by proving that rainbow-triangle-free colourings of projective geometries are exactly those that admit a certain decomposition into two-coloured pieces. This is closely analogous to a theorem of Gallai on rainbow-triangle-free coloured complete graphs. We also show that existing structure theorems resolve certain two-coloured cases where $(k,q) = (2,3)$, and $(k,q) = (3,2)$.

math.CO↗
arXiv2025

From plasma to pattern: observation and characterization of periodic structure formation in dielectric breakdown channels of electron-irradiated insulators

Dielectric breakdown of insulators is one of the most common failure modes of electronics in the high-radiation environment of space, but its mechanics remain poorly understood. When electron-irradiated polymethyl methacrylate (PMMA) undergoes breakdown, the resulting channels exhibit striking periodic structures with characteristic wavelengths ~80 μm in the recently identified ivy-mode channels. These previously unobserved modulations offer unique insights into the physics of ultra-fast dielectric breakdown. Through materials characterization and theoretical modeling, we identify the physical instability mechanism responsible for these structures. Raman spectroscopy reveals that carbon deposition correlates with channel width variations, indicating that periodic structure formation occurs during the plasma discharge phase. We evaluated three candidate instability mechanisms: the Asaro-Tiller-Grinfeld instability, the Plateau-Rayleigh instability, and the z-pinch entropy mode. The first two mechanisms operate on incompatible timescales and require unphysical material parameters to match observations. In contrast, the z-pinch entropy mode operates during the nanosecond discharge phase and produces wavelengths consistent with plasma densities of 0.1-1% of solid density and temperatures of 10-100 eV. Current measurements from isolated discharge channels (~200 A) validate theoretical predictions for the entropy mode. These findings establish that the entropy mode plasma instability during the discharge phase, rather than post discharge thermal or mechanical processes, govern periodic structure formation in breakdown channels. This work provides new insights into the physics of dielectric breakdown and establishes a framework for predicting discharge morphology and characteristics in insulators.

physics.app-ph↗
arXiv2025

Half-life Measurements of Highly Charged Radioisotopes by Nuclear Recoil in a Penning Trap

We present a novel method for measuring the half-life of highly charged radioisotopes by non-destructive nuclear recoil detection in a Penning ion trap. A specific emphasis is placed on $\rm ^7Be^{3+}$, which plays a crucial role in stellar evolution and the production of solar neutrinos. The determination of the half-life is necessary to constrain the free electron capture rate in the solar environment, but is difficult to measure by existing techniques. Simulations of the sympathetic cooling of the recoiled daughter nuclei ($\rm ^7Li^{3+}$) with the trapped cloud of $\rm ^7Be^{3+}$ demonstrate a decay detection efficiency of $99.5\%$. A statistical analysis of half-life measurements on ensembles containing hundreds of ions shows that a final statistical uncertainty of less than $5\%$ is achieved with only 500 measured decays. By coherent control of hyperfine populations in trapped ions, the fidelity of the technique we describe enables the direct measurement and manipulation of state-dependent decay branching ratios for the first time.

physics.ins-det↗
arXiv2022

The natural matroid of an integer polymatroid

The natural matroid of an integer polymatroid was introduced to show that a simple construction of integer polymatroids from matroids yields all integer polymatroids. As we illustrate, the natural matroid can shed much more light on integer polymatroids. We focus on characterizations of integer polymatroids using their bases, their circuits, and their cyclic flats along with the rank of each cyclic flat and each element; we offer some new characterizations and insights into known characterizations.

math.CO↗
arXiv2021

The excluded minors for lattice path polymatroids

We find the excluded minors for the minor-closed class of lattice path polymatroids as a subclass of the minor-closed class of Boolean polymatroids. Like lattice path matroids and Boolean polymatroids, there are infinitely many excluded minors, but they fall into a small number of easily-described types.

math.CO↗
arXiv2019

Decomposable polymatroids and connections with graph coloring

We introduce ideas that complement the many known connections between polymatroids and graph coloring. Given a hypergraph that satisfies certain conditions, we construct polymatroids, given as rank functions, that can be written as sums of rank functions of matroids, and for which the minimum number of matroids required in such sums is the chromatic number of the line graph of the hypergraph. This result motivates introducing chromatic numbers and chromatic polynomials for polymatroids. We show that the chromatic polynomial of any 2-polymatroid is a rational multiple of the chromatic polynomial of some graph. We also find the excluded minors for the minor-closed class of polymatroids that can be written as sums of rank functions of matroids that form a chain of quotients.

math.CO↗
arXiv2019

Matroids, Delta-matroids and Embedded Graphs

Matroid theory is often thought of as a generalization of graph theory. In this paper we propose an analogous correspondence between embedded graphs and delta-matroids. We show that delta-matroids arise as the natural extension of graphic matroids to the setting of embedded graphs. We show that various basic ribbon graph operations and concepts have delta-matroid analogues, and illustrate how the connections between embedded graphs and delta-matroids can be exploited. Also, in direct analogy with the fact that The Tutte polynomial is matroidal, we show that several polynomials of embedded graphs from the literature, including the Las Vergnas, Bollabas-Riordan and Krushkal polynomials, are in fact delta-matroidal.

math.CO↗
arXiv2019

On the interplay between embedded graphs and delta-matroids

The mutually enriching relationship between graphs and matroids has motivated discoveries in both fields. In this paper, we exploit the similar relationship between embedded graphs and delta-matroids. There are well-known connections between geometric duals of plane graphs and duals of matroids. We obtain analogous connections for various types of duality in the literature for graphs in surfaces of higher genus and delta-matroids. Using this interplay, we establish a rough structure theorem for delta-matroids that are twists of matroids, we translate Petrie duality on ribbon graphs to loop complementation on delta-matroids, and we prove that ribbon graph polynomials, such as the Penrose polynomial, the characteristic polynomial, and the transition polynomial, are in fact delta-matroidal. We also express the Penrose polynomial as a sum of characteristic polynomials.

math.CO↗
arXiv2019

The excluded 3-minors for vf-safe delta-matroids

Vf-safe delta-matroids have the desirable property of behaving well under certain duality operations. Several important classes of delta-matroids are known to be vf-safe, including the class of ribbon-graphic delta-matroids, which is related to the class of ribbon graphs or embedded graphs in the same way that graphic matroids correspond to graphs. In this paper, we characterize vf-safe delta-matroids and ribbon-graphic delta-matroids by finding the minimal obstructions, called excluded 3-minors, to membership in the class. We find the unique (up to twisted duality) excluded $3$-minor within the class of set systems for the class of vf-safe delta-matroids. In the literature, binary delta-matroids appear in many different guises, with appropriate notions of minor operations equivalent to that of $3$-minors, perhaps most notably as graphs with vertex minors. We give a direct explanation of this equivalence and show that some well-known results may be expressed in terms of $3$-minors.

math.CO↗
arXiv2019

Delta-matroids as subsystems of sequences of Higgs lifts

In her paper "Generalized matroids and supermodular colourings", Tardos studied special delta-matroids obtained from sequences of Higgs lifts; these are the full Higgs lift delta-matroids that we treat and around which all of our results revolve. We give an excluded-minor characterization of the class of full Higgs lift delta-matroids within the class of all delta-matroids, and we give similar characterizations of two other minor-closed classes of delta-matroids that we define using Higgs lifts. We introduce a minor-closed, dual-closed class of Higgs lift delta-matroids that arise from lattice paths. It follows from results of Bouchet that all delta-matroids can be obtained from full Higgs lift delta-matroids by removing certain feasible sets; to address which feasible sets can be removed, we give an excluded-minor characterization of delta-matroids within the more general structure of set systems. Many of these excluded minors occur again when we characterize the delta-matroids in which the collection of feasible sets is the union of the collections of bases of matroids of different ranks, and yet again when we require those matroids to have special properties, such as being paving.

math.CO↗
arXiv2017

The structure of delta-matroids with width one twists

The width of a delta-matroid is the difference in size between a maximal and minimal feasible set. We give a Rough Structure Theorem for delta-matroids that admit a twist of width one. We apply this theorem to give an excluded minor characterisation of delta-matroids that admit a twist of width at most one.

math.CO↗
arXiv2016

Towards a Splitter Theorem for Internally $4$-connected Binary Matroids VI

Let $M$ be a $3$-connected binary matroid; $M$ is called internally $4$-connected if one side of every $3$-separation is a triangle or a triad, and $M$ is $(4,4,S)$-connected if one side of every $3$-separation is a triangle, a triad, or a $4$-element fan. Assume $M$ is internally $4$-connected and that neither $M$ nor its dual is a cubic Möbius or planar ladder or a certain coextension thereof. Let $N$ be an internally $4$-connected proper minor of $M$. Our aim is to show that $M$ has a proper internally $4$-connected minor with an $N$-minor that can be obtained from $M$ either by removing at most four elements, or by removing elements in an easily described way from a special substructure of $M$. When this aim cannot be met, the earlier papers in this series showed that, up to duality, $M$ has a good bowtie, that is, a pair, $\{x_1,x_2,x_3\}$ and $\{x_4,x_5,x_6\}$, of disjoint triangles and a cocircuit, $\{x_2,x_3,x_4,x_5\}$, where $M\backslash x_3$ has an $N$-minor and is $(4,4,S)$-connected. We also showed that, when $M$ has a good bowtie, either $M\backslash x_3,x_6$ has an $N$-minor; or $M\backslash x_3/x_2$ has an $N$-minor and is $(4,4,S)$-connected. In this paper, we show that, when $M\backslash x_3,x_6$ has an $N$-minor but is not $(4,4,S)$-connected, $M$ has an internally $4$-connected proper minor with an $N$-minor that can be obtained from $M$ by removing at most three elements, or by removing elements in a well-described way from one of several special substructures of $M$. This is a significant step towards obtaining a splitter theorem for the class of internally $4$-connected binary matroids.

math.CO↗
arXiv2016

Towards a Splitter Theorem for Internally $4$-connected Binary Matroids VII

Let $M$ be a $3$-connected binary matroid; $M$ is internally $4$-connected if one side of every $3$-separation is a triangle or a triad, and $M$ is $(4,4,S)$-connected if one side of every $3$-separation is a triangle, a triad, or a $4$-element fan. Assume $M$ is internally $4$-connected and that neither $M$ nor its dual is a cubic Möbius or planar ladder or a certain coextension thereof. Let $N$ be an internally $4$-connected proper minor of $M$. Our aim is to show that $M$ has a proper internally $4$-connected minor with an $N$-minor that can be obtained from $M$ either by removing at most four elements, or by removing elements in an easily described way from a special substructure of $M$. When this aim cannot be met, the earlier papers in this series showed that, up to duality, $M$ has a good bowtie, that is, a pair, $\{x_1,x_2,x_3\}$ and $\{x_4,x_5,x_6\}$, of disjoint triangles and a cocircuit, $\{x_2,x_3,x_4,x_5\}$, where $M\backslash x_3$ has an $N$-minor and is \ffsc. We also showed that, when $M$ has a good bowtie, either $M\backslash x_3,x_6$ has an $N$-minor and $M\backslash x_6$ is $(4,4,S)$-connected; or $M\backslash x_3/x_2$ has an $N$-minor and is \ffsc. In this paper, we show that, when $M\backslash x_3,x_6$ has no $N$-minor, $M$ has an internally $4$-connected proper minor with an $N$-minor that can be obtained from $M$ by removing at most three elements, or by removing elements in a well-described way from a special substructure of $M$. This is the penultimate step towards obtaining a splitter theorem for the class of internally $4$-connected binary matroids.

math.CO↗
arXiv2016

Towards a splitter theorem for internally 4-connected binary matroids VIII: small matroids

Our splitter theorem for internally 4-connected binary matroids studies pairs of the form (M,N), where N and M are internally 4-connected binary matroids, M has a proper N-minor, and if M' is an internally 4-connected matroid such that M has a proper M'-minor and M' has an N-minor, then |E(M)|-|E(M')|>3. The analysis in the splitter theorem requires the constraint that |E(M)|>15. In this article, we complement that analysis by using an exhaustive computer search to find all such pairs satisfying |E(M)|<16.

math.CO↗
arXiv2015

Computer-verification of the structure of some classes of fragile matroids

This technical report accompanies the following three papers. It contains the computations necessary to verify some of the results claimed in those papers. [1] Carolyn Chun, Deborah Chun, Dillon Mayhew, and Stefan H. M. van Zwam. Fan-extensions in fragile matroids. In preparation. [2] Carolyn Chun, Dillon Mayhew, Geoff Whittle, and Stefan H. M. van Zwam. The structure of binary Fano-fragile matroids. In preparation. [3] Ben Clark, Dillon Mayhew, Geoff Whittle, and Stefan H. M. van Zwam. The structure of {U2,5, U3,5}-fragile matroids. In preparation.

math.CO↗