SearcharxivSearch

arXiv subjects

William Cocke

Publications and source records attributed to William Cocke.

14 recordsLinked to original sources

The category of centralizer lattices of groups

We formalize the concept of a centralizer-respecting homomorphism, surjective homomorphisms which are equivariant with respect to taking the centralizer of a subgroup. There is a functor from the category of centralizer-respecting homomorphisms to the category of centralizer lattices. Finally, we conclude with some theorems about centralizer-respecting homomorphisms that show that the category of centralizer-respecting homomorphisms has many interesting maps.

math.GR

LOCUS: Low-Dimensional Model Embeddings for Efficient Model Exploration, Comparison, and Selection

The rapidly growing ecosystem of Large Language Models (LLMs) makes it increasingly challenging to manage and utilize the vast and dynamic pool of models effectively. We propose LOCUS, a method that produces low-dimensional vector embeddings that compactly represent a language model's capabilities across queries. LOCUS is an attention-based approach that generates embeddings by a deterministic forward pass over query encodings and evaluation scores via an encoder model, enabling seamless incorporation of new models to the pool and refinement of existing model embeddings without having to perform any retraining. We additionally train a correctness predictor that uses model embeddings and query encodings to achieve state-of-the-art routing accuracy on unseen queries. Experiments show that LOCUS needs up to 4.8x fewer query evaluation samples than baselines to produce informative and robust embeddings. Moreover, the learned embedding space is geometrically meaningful: proximity reflects model similarity, enabling a range of downstream applications including model comparison and clustering, model portfolio selection, and resilient proxies of unavailable models.

cs.LG

The Chermak-Delgado Measure as a Map on Posets

The Chermak-Delgado measure of a finite group is a function which assigns to each subgroup a positive integer. In this paper, we give necessary and sufficient conditions for when the Chermak-Delgado measure of a group is actually a map of posets, i.e., a monotone function from the subgroup lattice to the positive integers. We also investigate when the Chermak-Delgado measure, restricted to the centralizers, is increasing.

math.GR

Exponent-Critical Groups

We define and investigate the property of being `exponent-critical' for a finite group. A finite group is said to be exponent-critical if its exponent is not the least common multiple of the exponents of its proper non-abelian subgroups. We explore properties of exponent-critical groups and give a characterization of such groups. This characterization generalises a classical result of Miller and Moreno on minimal non-abelian groups; interesting families of $p$-groups appear.

math.GR

The Amit-Ashurst conjecture for finite metacyclic p-groups

The Amit conjecture about word maps on finite nilpotent groups has been shown to hold for certain classes of groups. The generalised Amit conjecture says that the probability of an element occurring in the image of a word map on a finite nilpotent group G is either 0, or at least 1/|G|. Noting the work of Ashurst, we name the generalised Amit conjecture the Amit-Ashurst conjecture and show that the Amit-Ashurst conjecture holds for finite p-groups with a cyclic maximal subgroup.

math.GR

On groups with few subgroups not in the Chermak-Delgado lattice

We investigate the question of how many subgroups of a finite group are not in its Chermak-Delgado lattice. The Chermak-Delgado lattice for a finite group is a self-dual lattice of subgroups with many intriguing properties. Fasol\u{a} and T\u{a}rn\u{a}uceanu asked how many subgroups are not in the Chermak-Delgado lattice and classified all groups with two or less subgroups not in the Chermak-Delgado lattice. We extend their work by classifying all groups with less than five subgroups not in the Chermak-Delgado lattice. In addition, we show that a group with less than five subgroups not in the Chermak--Delgado lattice is nilpotent. In this vein we also show that the only non-nilpotent group with five or fewer subgroups in the Chermak-Delgado lattice is S_3.

math.GR

Central Products and the Chermak-Delgado Lattice

The Chermak-Delgado lattice of a finite group is a modular, self-dual sublattice of the lattice of subgroups. We prove that the Chermak-Delgado lattice of a central product contains the product of the Chermak-Delgado lattices of the relevant central factors. Furthermore, we obtain information about heights of elements in the Chermak-Delgado lattice relative to their heights in the Chermak-Delgado lattices of central factors. We also explore how the central product can be used as a tool in investigating Chermak-Delgado lattices.

math.GR

Model Repair via Symmetry

The symmetry of a Kripke structure $\mathcal{M}$ has been exploited to replace a model check of $\mathcal{M}$ by a model check of the potentially smaller structure $\mathcal{N}$ obtained as the quotient of $\mathcal{M}$ by its symmetry group $G$. We extend previous work to model repair: identify a substructure that satisfies a given temporal logic formula. We show that the substructures of $\mathcal{M}$ that are preserved by $G$ form a lattice that maps to the substructure lattice of $\mathcal{N}$. We also show the existence of a monotone Galois connection between the lattice of substructures of $\mathcal{N}$ and the lattice of substructures of $\mathcal{M}$ that are "maximal" w.r.t. an appropriately defined group action of $G$ on $\mathcal{M}$. These results enable us to repair $\mathcal{N}$ and then to lift the repair to $\mathcal{M}$. We can thus repair symmetric finite-state concurrent programs by repairing the corresponding $\mathcal{N}$, thereby effecting program repair while avoiding state-explosion.

cs.LO

A Database of Groups with Equivalent Character Tables

Two groups are said to have the same character table if a permutation of the rows and a permutation of the columns of one table produces the other table. The problem of determining when two groups have the same character table is computationally intriguing. We have constructed a database containing for all finite groups of order less than 2000 (excluding those of order 1024), a partitioning of groups into classes having the same character table. To handle the 408,641,062 groups of order 1536 and other orders with a large number of groups we utilized high-throughput computing together with a new algorithmic approach to the problem. Our approach involved using graph isomorphism software to construct canoncial graphs that correspond to the character table of a group and then hashing the graphs.

math.GR

Word Maps in Finite Simple Groups

Elements of the free group define interesting maps, known as word maps, on groups. It was previously observed by Lubotzky that every subset of a finite simple group that is closed under endomorphisms occurs as the image of some word map. We improve upon this result by showing that the word in question can be chosen to be in any $v(\textbf{F}_n)$ provided that $v$ is not a law on the finite simple group in question. In addition, we provide an example of a word $w$ that witnesses the chirality of the Mathieu group $M_{11}$. The paper concludes by demonstrating that not every subset of a group closed under endomorphisms occurs as the image of a word map.

math.GR

On the Number of Not Powers in a Finite Group

Let G be a finite group and let k be a positive integer. We examine the relationship between structural properties of G and the number of elements of G that are not kth powers in G. In particular, we examine a bound on |G| given by Lucido and Pournaki and classify all cases when it is strict. We also show that when k is an odd prime, then either G has a normal subgroup with specific properties, or |G| is bounded above by a tighter function dependent on the number of not k-th powers of G.

math.GR

The Probability Distribution of Word Maps on Finite Groups

Word maps provide a wealth of information about finite groups. We examine the connection between the probability distribution induced by a word map and the underlying structure of a finite group. We show that a finite group is nilpotent if and only if every surjective word map has fibers of uniform size. Moreover, we show that probability distributions themselves are sufficient to identify nilpotent groups, and these same distributions can be used to determine abelian groups up to isomorphism. In addition we answer a question of Amit and Vishne.

math.GR

On the Symmetry of Images of Word Maps in Groups

Word maps in a group, an analogue of polynomials in groups, are defined by substitution of formal words. Lubotzky gave a characterization of the images of word maps in finite simple groups, and a consequence of his characterization is the existence of a group G such that the image of some word map on G is not closed under inversion. We explore sufficient conditions on a group that ensure that the image of all word maps on G are closed under inversion. We then show that there are only two groups with order less than 108 with the property that there is a word map with image not closed under inversion. We also study this behavior in nilpotent groups.

math.GR