Search

The nilCoxeter algebra $\mathcal{N}S_n$ of the symmetric group $S_n$ is the algebra over $\mathbb{Z}$ with generators $Y_i$ ($1\leqslant i\leqslant n-1$), satisfying the braid relations $Y_iY_{i+1}Y_i=Y_{i+1}Y_iY_{i+1}$, $Y_iY_j=Y_jY_i$ ($|j-i|\geqslant 2$), together with the relations $Y_i^2=0$. We describe an explicit presentation for the cohomology ring $Z\cong\mathsf{Ext}^*_{\mathcal{N}S_n}(\mathbb{Z},\mathbb{Z})$, with $n-i$ new generators in degree $i$ for $0< i

Algebras defined over fields of characteristic zero and positive characteristic usually do not behave the same way. However, for certain algebras, for example the group algebras, they behave the same way as the characteristic zero case at good enough prime. In this paper, we initiate the study of this topic by imposing increasingly strong hypotheses on basic algebras. When the algebras satisfy the right hypotheses, we have equalities of the dimensions of their cohomology groups between simple modules and equalities of graded Cartan numbers. The examples include the Solomon descent algebras of finite Coxeter groups at large enough primes, nil-Coxeter algebra, and certain finite semigroup algebras at an arbitrary prime.

Let $G$ be a finite group and $\mathsf{k}$ a field of characteristic $p$. It is conjectured in a paper of the first author and John Greenlees that the thick subcategory of the stable module category StMod$(\mathsf{k}G)$ consisting of modules whose cohomology is finitely generated over $\mathsf{H}^*(G,\mathsf{k})$ is generated by finite dimensional modules and modules with no cohomology. If the centraliser of every element of order $p$ in $G$ is $p$-nilpotent, this statement follows from previous work. Our purpose here is to prove this conjecture in two cases with non $p$-nilpotent centralisers. The groups involved are ${\mathbb Z}/3^r\times\Sigma_3$ ($r> 0$) in characteristic three and ${\mathbb Z}/2\times A_4$ in characteristic two. As a consequence, in these cases the bounded derived category of $C^*BG$ (cochains on $BG$ with coefficients in $\mathsf{k}$) is generated by $C^*BS$, where $S$ is a Sylow $p$-subgroup of $G$., Comment: 11 pages

We are given a finite group $H$, an automorphism $\tau$ of $H$ of order $r$, a Galois extension $L/K$ of fields of characteristic zero with cyclic Galois group $\langle\sigma\rangle$ of order $r$, and an absolutely irreducible representation $\rho\colon H\to\operatorname{\sf GL}(n,L)$ such that the action of $\tau$ on the character of $\rho$ is the same as the action of $\sigma$. Then the following are equivalent. $\bullet$ $\rho$ is equivalent to a representation $\rho'\colon H\to\operatorname{\sf GL}(n,L)$ such that the action of $\sigma$ on the entries of the matrices corresponds to the action of $\tau$ on $H$, and $\bullet$ the induced representation $\operatorname{\sf ind}_{H,H\rtimes\langle\tau\rangle}(\rho)$ has Schur index one; that is, it is similar to a representation over $K$. As examples, we discuss a three dimensional irreducible representation of $A_5$ over $\mathbb{Q}[\sqrt5]$ and a four dimensional irreducible representation of the double cover of $A_7$ over $\mathbb{Q}[\sqrt{-7}]$., Comment: 6 pages

Let $G$ be a finite group and $k$ a field of characteristic $p$. We conjecture that if $M$ is a $kG$-module with $H^*(G,M)$ finitely generated as a module over $H^*(G,k)$ then as an element of the stable module category $\mathsf{StMod}(kG)$, $M$ is contained in the thick subcategory generated by the finitely generated $kG$-modules and the modules $M'$ with $H^*(G,M')=0$. We show that this is equivalent to a conjecture of the second author about generation of the bounded derived category of cochains $C^*(BG;k)$, and we prove the conjecture in the case where the centraliser of every element of $G$ of order $p$ is $p$-nilpotent. In this case some stronger statements are true, that probably fail for more general finite groups., Comment: HIM-Spectral-22, 15 pages

Let $G$ be a finite $p$-group, and $\alpha$ an automorphism of the group algebra ${\mathbb F}_pG$. Then $\alpha$ fixes the socle of ${\mathbb F}_pG$ pointwise. More generally, if $k$ is a field of characteristic $p$, and $\alpha$ is a $k$-algebra automorphism of $kG$, then $\alpha$ induces a linear action on the dimension subquotients of the group, and the action on the socle is scalar multiplication by the $(p-1)$st power of the product of the determinants of this action. The scalar is thus an element of $(k^\times)^{p-1}$., Comment: 3 pages

We relate the generating functions of the dimensions of the Hochschild cohomology in any fixed degree of the symmetric groups with those of blocks of the symmetric groups. We show that the first Hochschild cohomology of a positive defect block of a symmetric group is non-zero, answering in the affirmative a question of the third author. To do this, we prove a formula expressing the dimension of degree one Hochschild cohomology as a sum of dimensions of centres of blocks of smaller symmetric groups. This in turn is a consequence of a general formula that makes more precise a theorem of our previous paper describing the generating functions for the dimensions of Hochschild cohomology of symmetric groups.

Thanks to the work of Karin Erdmann, we know a great deal about the representation theory of blocks of finite groups with tame representation type. Our purpose here is to examine the $p$-completed classifying spaces of these blocks and their loop spaces. We pay special attention to the $A_\infty$ algebra structures, and singularity and cosingularity categories., Comment: 120 pages

We answer in the negative a question of Hartley about representations of finite groups, by constructing examples of finite simple groups with arbitrarily large representations whose endomorphism ring consists of just the scalars. We show as a consequence that there are finite simple groups of automorphisms of the locally finite simple group $SL(\infty,\mathbb{F}_q)$ with trivial centraliser. The smallest of our examples is $A_6$ with $q=9$., Comment: 10 pages

Let $G$ be a compact Lie group with maximal torus $T$. If $|N_G(T)/T|$ is invertible in the field $k$ then the algebra of cochains $C^*(BG;k)$ is formal as an $A_\infty$ algebra, or equivalently as a DG algebra., Comment: 8 pages

We compute the dimensions of the Hochschild cohomology of symmetric groups over prime fields in low degrees. This involves us in studying some partition identities and generating functions of the dimensions in any fixed degree of the Hochschild cohomology of symmetric groups., Comment: 14 pages

We develop a multi-dimensional, parallelized domain decomposition strategy (DDC) for mass-transfer particle tracking (MTPT) methods. These methods are a type of Lagrangian algorithm for simulating reactive transport and are able to be parallelized by employing large numbers of CPU cores to accelerate run times. In this work, we investigate different procedures for "tiling" the domain in two and three dimensions, (2-d and 3-d), as this type of formal DDC construction is currently limited to 1-d. An optimal tiling is prescribed based on physical problem parameters and the number of available CPU cores, as each tiling provides distinct results in both accuracy and run time. We further extend the most efficient technique to 3-d for comparison, leading to an analytical discussion of the effect of dimensionality on strategies for implementing DDC schemes. Increasing computational resources (cores) within the DDC method produces a trade-off between inter-node communication and on-node work. For an optimally subdivided diffusion problem, the 2-d parallelized algorithm achieves nearly perfect linear speedup in comparison with the serial run up to around 2700 cores, reducing a 5-hour simulation to 8 seconds, and the 3-d algorithm maintains appreciable speedup up to 1700 cores., Comment: 26 pages, 21 figures, Submitted to Journal of Computational Physics (JCP)

Let $k$ be an algebraically closed field of prime characteristic $p$. Let $kGe$ be a block of a group algebra of a finite group $G$, with normal defect group $P$ and abelian $p'$ inertial quotient $L$. Then we show that $kGe$ is a matrix algebra over a quantised version of the group algebra of a semidirect product of $P$ with a certain subgroup of $L$. To do this, we first examine the associated graded algebra, using a Jennings--Quillen style theorem. As an example, we calculate the associated graded of the basic algebra of the non-principal block in the case of a semidirect product of an extraspecial $p$-group $P$ of exponent $p$ and order $p^3$ with a quaternion group of order eight with the centre acting trivially. In the case $p=3$ we give explicit generators and relations for the basic algebra as a quantised version of $kP$. As a second example, we give explicit generators and relations in the case of a group of shape $2^{1+4}:3^{1+2}$ in characteristic two., Comment: 21 pages

Traditional probabilistic methods for the simulation of advection-diffusion equations (ADEs) often overlook the entropic contribution of the discretization, e.g., the number of particles, within associated numerical methods. Many times, the gain in accuracy of a highly discretized numerical model is outweighed by its associated computational costs or the noise within the data. We address the question of how many particles are needed in a simulation to best approximate and estimate parameters in one-dimensional advective-diffusive transport. To do so, we use the well-known Akaike Information Criterion (AIC) and a recently-developed correction called the Computational Information Criterion (COMIC) to guide the model selection process. Random-walk and mass-transfer particle tracking methods are employed to solve the model equations at various levels of discretization. Numerical results demonstrate that the COMIC provides an optimal number of particles that can describe a more efficient model in terms of parameter estimation and model prediction compared to the model selected by the AIC even when the data is sparse or noisy, the sampling volume is not uniform throughout the physical domain, or the error distribution of the data is non-IID Gaussian., Comment: 24 pages

Traditional interpolation techniques for particle tracking include binning and convolutional formulas that use pre-determined (i.e., closed-form, parameteric) kernels. In many instances, the particles are introduced as point sources in time and space, so the cloud of particles (either in space or time) is a discrete representation of the Green's function of an underlying PDE. As such, each particle is a sample from the Green's function; therefore, each particle should be distributed according to the Green's function. In short, the kernel of a convolutional interpolation of the particle sample "cloud" should be a replica of the cloud itself. This idea gives rise to an iterative method by which the form of the kernel may be discerned in the process of interpolating the Green's function. When the Green's function is a density, this method is broadly applicable to interpolating a kernel density estimate based on random data drawn from a single distribution. We formulate and construct the algorithm and demonstrate its ability to perform kernel density estimation of skewed and/or heavy-tailed data including breakthrough curves.

In a recent paper of Benson and Symonds, a new invariant was introduced for modular representations of a finite group. An interpretation was given as a spectral radius with respect to a Banach algebra completion of the representation ring. Our purpose here is to take these notions further, and investigate the structure of the resulting Banach algebras. Some of the material in that paper is repeated here in greater generality, and for clarity of exposition. We give an axiomatic definition of an abstract representation ring, and representation ideal. The completion is then a commutative Banach algebra, and the techniques of Gelfand from the 1940s are applied in order to study the space of algebra homomorphisms to $\mathbb C$. One surprising consequence of this investigation is that the Jacobson radical and the nil radical of a (complexified) representation ring always coincide. These notes are intended for representation theorists. So background material on commutative Banach algebras is given in detail, whereas representation theoretic background is more condensed., Comment: 120 pages; accepted for publication in Memoirs of the AMS

We describe graded commutative Gorenstein algebras ${\mathcal E}_n(p)$ over a field of characteristic $p$, and we conjecture that $\mathrm{Ext}^\bullet_{\mathsf{Ver}_{p^{n+1}}}(1,1)\cong{\mathcal E}_{n}(p)$, where $\mathsf{Ver}_{p^{n+1}}$ are the new symmetric tensor categories recently constructed in \cite{Benson/Etingof:2019a,Benson/Etingof/Ostrik,Coulembier}. We investigate the combinatorics of these algebras, and the relationship with Minc's partition function, as well as possible actions of the Steenrod operations on them. Evidence for the conjecture includes a large number of computations for small values of $n$. We also provide some theoretical evidence. Namely, we use a Koszul construction to identify a homogeneous system of parameters in ${\mathcal E}_n(p)$ with a homogeneous system of parameters in $\mathrm{Ext}^\bullet_{\mathsf{Ver}_{p^{n+1}}}(1,1)$. These parameters have degrees $2^i-1$ if $p=2$ and $2(p^i-1)$ if $p$ is odd, for $1\le i \le n$. This at least shows that $\mathrm{Ext}^\bullet_{\mathsf{Ver}_{p^{n+1}}}(1,1)$ is a finitely generated graded commutative algebra with the same Krull dimension as ${\mathcal E}_n(p)$. For $p=2$ we also show that $\mathrm{Ext}^\bullet_{\mathsf{Ver}_{2^{n+1}}}(1,1)$ has the expected rank $2^{n(n-1)/2}$ as a module over the subalgebra of parameters., Comment: 30 pages

Let $k$ be a field of characteristic $p > 0$. For $G$ an elementary abelian $p$-group, there exist collections of permutation module such that if $C^*$ is any exact bounded complex whose terms are sums of copies of modules from the collection, then $C^*$ is contractible. A consequence is that if $G$ is any finite group whose Sylow $p$-subgroups are not cyclic or quaternion, and if $C^*$ is a bounded exact complex such that each $C^i$ is direct sum of one dimensional modules and projective modules, then $C^*$ is contractible., Comment: 7 pages

Geochemical systems are known to exhibit highly variable spatiotemporal behavior. This may be observed both in non-smooth concentration curves in space for a single sampling time and also in variability between samples taken from the same location at different times. However, most models that are designed to simulate these systems provide only single-solution smooth curves and fail to capture the noise and variability seen in the data. We apply a recently developed reactive particle-tracking method to a system that displays highly-complex geochemical behavior. When the method is made to most closely resemble a corresponding Eulerian method, in its unperturbed form, we see near-exact match between solutions of the two models. More importantly, we consider two approaches for perturbing the model and find that the spatially-perturbed condition is able to capture a greater degree of the variability present in the data. This method of perturbation is a task to which particle methods are uniquely suited and Eulerian models are not well-suited. Additionally, because of the nature of the algorithm, noisy spatial gradients can be highly resolved by a large number of mobile particles, and this incurs negligible computational cost, as compared to expensive chemistry calculations., Comment: 29 pages, 8 figures

Traditional random-walk particle-tracking (PT) models of advection and dispersion do not track entropy, because particle masses remain constant. Newer mass-transfer particle tracking (MTPT) models have the ability to do so because masses of all compounds may change along trajectories. Additionally, the probability mass functions (PMF) of these MTPT models may be compared to continuous solutions with probability density functions, when a consistent definition of entropy (or similarly, the dilution index) is constructed. This definition reveals that every numerical model incurs a computational entropy. Similar to Akaike's entropic penalty for larger numbers of adjustable parameters, the computational complexity of a model (e.g., number of nodes) adds to the entropy and, as such, must be penalized. The MTPT method can use a particle-collision based kernel or an SPH-derived adaptive kernel. The latter is more representative of a locally well-mixed system (i.e., one in which the dispersion tensor equally represents mixing and solute spreading), while the former better represents the separate processes of mixing versus spreading. We use computational means to demonstrate the viability of each of these methods.

Several Lagrangian methodologies have been proposed in recent years to simulate advection-dispersion of solutes in fluids as a mass exchange between numerical particles carrying the fluid. In this paper, we unify these methodologies, showing that mass transfer particle tracking (MTPT) algorithms can be framed within the context of smoothed particle hydrodynamics (SPH), provided the choice of a Gaussian smoothing kernel whose bandwidth depends on the dispersion and the time discretization. Numerical simulations are performed for a simple dispersion problem, and they are compared to an analytical solution. Based on the results, we advocate for the use of a kernel bandwidth of the size of the characteristic dispersion length $\ell=\sqrt{2D\Delta t}$, at least given a "dense enough" distribution of particles, for in this case the mass transfer operation is not just an approximation, but in fact the exact solution, of the solute's displacement by dispersion in a time step.

Recent advances in random-walk particle-tracking have enabled direct simulation of mixing and reactions on particles by allowing the particles to interact with each other using a multi-point mass transfer scheme. The mass transfer scheme allows separation of mixing and spreading processes, among other advantages, but it is computationally expensive because its speed depends on the number of interacting particle pairs. This note explores methods for relieving the computational bottleneck caused by the mass transfer step, and we use these algorithms to develop a new parallel, interacting particle model. The new model is a combination of a sparse search algorithm and a novel domain-decomposition scheme, both of which offer significant speedup relative to the reference case--even when they are executed serially. We combine the strengths of these methods to create a parallel particle scheme that is highly accurate and efficient with run times that scale as $1 / P$ for a fixed number of particles, where $P$ is the number of computational cores being used. The new parallel model is a significant advance because it enables efficient simulation of large particle ensembles that are needed for environmental simulations, and also because it can naturally pair with parallel geochemical solvers to create a practical Lagrangian tool for simulating mixing and reactions in complex chemical systems., Comment: 29 pages, 4 figures

The Eulerian advection-dispersion-reaction equation (ADRE) suffers the well-known scale-effect of reduced apparent reaction rates between chemically dissimilar fluids at larger scales (or dimensional averaging). The dispersion tensor in the ADRE must equally and simultaneously account for both solute mixing and spreading. Recent reactive-particle-tracking (RPT) algorithms can, by separate mechanisms, simulate 1) smaller-scale mixing by inter-particle mass transfer, and 2) mass spreading by traditional random walks. To test the supposition that the RPT can accurately track these separate mechanisms, we upscale reactive transport in Hagen-Poiseuille flow between two plates. The simple upscaled 1-D RPT model with one velocity value, an upscaled Taylor macro-dispersivity, and the local molecular diffusion coefficient matches the results obtained from a detailed 2-D model with fully described velocity and diffusion. Both models use the same thermodynamic reaction rate, because the rate is not forced to absorb the loss of information upon upscaling. Analytic and semi-analytic upscaling is also performed using volume averaging and ensemble streamtube techniques. Volume averaging does not perform as well as the RPT, while ensemble streamtubes (using an effective dispersion coefficient along with macro-dispersion) perform almost exactly the same as RPT.

Let $k$ be an algebraically closed field of characteristic $p$, and let $\mathcal{O}$ be either $k$ or its ring of Witt vectors $W(k)$. Let $G$ a finite group and $B$ a block of $\mathcal{O}G$ with normal abelian defect group and abelian $p'$ inertial quotient. We show that $B$ is isomorphic to its second Frobenius twist. This is motivated by the fact that bounding Frobenius numbers is one of the key steps towards Donovan's conjecture. For $\mathcal{O}=k$, we give an explicit description of the basic algebra of $B$ as a quiver with relations. It is a quantised version of the group algebra of the semidirect product $P\rtimes L$.

A significant drawback of Lagrangian (particle-tracking) reactive transport models has been their inability to properly simulate interactions between solid and liquid chemical phases, such as dissolution and precipitation reactions. This work addresses that problem by implementing a mass-transfer algorithm between mobile and immobile sets of particles that allows aqueous species of reactant that are undergoing transport to interact with stationary solid species. This mass-transfer algorithm is demonstrated to solve the diffusion equation and thus does not introduce any spurious mixing. The algorithm is capable of simulating an arbitrarily small level of diffusion, and can be combined with diffusive random walks to simulate the desired level of diffusion in a reactive transport system., Comment: 43 pages, 15 figures

Several algorithms have been used for mass transfer between particles undergoing advective and macro-dispersive random walks. The mass transfer between particles is required for general reactions on, and among, particles. The mass transfer is shown to be diffusive, and may be simulated using implicit, explicit, or mixed methods. All algorithms investigated are accurate to $\mathcal{O}(\Delta t)$. For $N$ particles, the implicit and semi-implicit methods require inverse matrix solutions and $\mathcal{O}(N^3)$ calculations. The explicit methods use forward matrix solves and require only $\mathcal{O}(N^2)$ calculations. Practically, this means that naive implementations with more than about 5,000 particles run more reliably using explicit methods, Comment: 14 pages, 3 figures

Current Lagrangian (particle-tracking) algorithms used to simulate diffusion-reaction equations must employ a certain number of particles to properly emulate the system dynamics---particularly for imperfectly-mixed systems. The number of particles is tied to the statistics of the initial concentration fields of the system at hand. Systems with shorter-range correlation and/or smaller concentration variance require more particles, potentially limiting the computational feasibility of the method. For the well-known problem of bimolecular reaction, we show that using kernel-based, rather than Dirac-delta, particles can significantly reduce the required number of particles. We derive the fixed width of a Gaussian kernel for a given reduced number of particles that analytically eliminates the error between kernel and Dirac solutions at any specified time. We also show how to solve for the fixed kernel size by minimizing the squared differences between solutions over any given time interval. Numerical results show that the width of the kernel should be kept below about 12% of the domain size, and that the analytic equations used to derive kernel width suffer significantly from the neglect of higher-order moments. The simulations with a kernel width given by least squares minimization perform better than those made to match at one specific time. A heuristic time-variable kernel size, based on the previous results, performs on a par with the least squares fixed kernel size., Comment: 28 pages, 7 figures