Driss Bennis, Enrique Duarte, Juan R. García Rozas
et al.
AbstractLetRRbe a ring,CCbe a leftRR-module andS=EndR(C)S={{\rm{End}}}_{R}\left(C). WhenCCis semidualizing, the Auslander classAC(S){{\mathcal{A}}}_{C}\left(S)and the Bass classℬC(R){{\mathcal{ {\mathcal B} }}}_{C}\left(R)associated withCChave been the subject of extensive investigations. It has been proved that these classes, also known as Foxby classes, are one of the central concepts of (relative) Gorenstein homological algebra. In this paper, we answer several natural questions which arise when we weaken the condition ofCCbeing semidualizing: if we letCCbe w-tilting (see Definition 2.1), we establish the conditions for the pair(AC(S),AC(S)⊥1)\left({{\mathcal{A}}}_{C}\left(S),{{\mathcal{A}}}_{C}{\left(S)}^{{\perp }_{1}})to be a perfect cotorsion theory and for the pair(BC⊥1(R),BC(R))\left({}^{{\perp }_{1}}B_{C}\left(R),{B}_{C}\left(R))to be a complete hereditary cotorsion theory. This tells us when the classes of Auslander and Bass are preenveloping and precovering, which generalizes a number of results disseminated in the literature. We investigate Gorenstein flat modules relative to a not necessarily semidualizing moduleCCand we find conditions for the class ofGC{G}_{C}-projective modules to be special precovering, the class ofGC{G}_{C}-flat modules to be covering, the one of GorensteinCC-projective modules to be precovering and that of GorensteinCC-injective modules to be preenveloping. We also find how to recover Foxby classes fromAddR(C){{\rm{Add}}}_{R}\left(C)-resolutions ofRR.
Neumann-Lara and Škrekovski conjectured that every planar digraph is 2-colourable. We show that this conjecture is equivalent to the more general statement that all oriented K_5-minor-free graphs are 2-colourable.
Abstract Multi-type infection processes are ubiquitous in ecology, epidemiology and social systems, but remain hard to analyze and to understand on a fundamental level. Here, we study a multi-strain susceptible-infected-susceptible model with coinfection. A host already colonized by one strain can become more or less vulnerable to co-colonization by a second strain, as a result of facilitating or competitive interactions between the two. Fitness differences between N strains are mediated through $$N^2$$ N 2 altered susceptibilities to secondary infection that depend on colonizer-cocolonizer identities ( $$K_{ij}$$ K ij ). By assuming strain similarity in such pairwise traits, we derive a model reduction for the endemic system using separation of timescales. This ‘quasi-neutrality’ in trait space sets a fast timescale where all strains interact neutrally, and a slow timescale where selective dynamics unfold. We find that these slow dynamics are governed by the replicator equation for N strains. Our framework allows to build the community dynamics bottom-up from only pairwise invasion fitnesses between members. We highlight that mean fitness of the multi-strain network, changes with their individual dynamics, acts equally upon each type, and is a key indicator of system resistance to invasion. By uncovering the link between N -strain epidemiological coexistence and the replicator equation, we show that the ecology of co-colonization relates to Fisher’s fundamental theorem and to Lotka-Volterra systems. Besides efficient computation and complexity reduction for any system size, these results open new perspectives into high-dimensional community ecology, detection of species interactions, and evolution of biodiversity.
Lusztig's theory of PBW bases gives a way to realize the crystal B(∞) for any simple complex Lie algebra where the underlying set consists of Kostant partitions. In fact, there are many different such realizations, one for each reduced expression for the longest element of the Weyl group. There is an algorithm to calculate the actions of the crystal operators, but it can be quite complicated. For ADE types, we give conditions on the reduced expression which ensure that the corresponding crystal operators are given by simple combinatorial bracketing rules. We then give at least one reduced expression satisfying our conditions in every type except E8, and discuss the resulting combinatorics. Finally, we describe the relationship with more standard tableaux combinatorics in types A and D.
In this extended abstract we present colored generalizations of the symmetric algebra and its Koszul dual, the exterior algebra. The symmetric group Sn acts on the multilinear components of these algebras. While Sn acts trivially on the multilinear components of the colored symmetric algebra, we use poset topology techniques to describe the representation on its Koszul dual. We introduce an Sn-poset of weighted subsets that we call the weighted boolean algebra and we prove that the multilinear components of the colored exterior algebra are Sn- isomorphic to the top cohomology modules of its maximal intervals. We show that the two colored Koszul dual algebras are Koszul in the sense of Priddy et al.
Stuart Margolis, Franco Saliola, Benjamin Steinberg
We present a beautiful interplay between combinatorial topology and homological algebra for a class of monoids that arise naturally in algebraic combinatorics. We explore several applications of this interplay. For instance, we provide a new interpretation of the Leray number of a clique complex in terms of non-commutative algebra.
We present a generalization of the chromatic polynomial, and chromatic symmetric function, arising in the study of combinatorial species. These invariants are defined for modules over lattice rings in species. The primary examples are graphs and set partitions. For these new invariants, we present analogues of results regarding stable partitions, the bond lattice, the deletion-contraction recurrence, and the subset expansion formula. We also present two detailed examples, one related to enumerating subgraphs by their blocks, and a second example related to enumerating subgraphs of a directed graph by their strongly connected components.
We consider two aspects of Kronecker coefficients in the directions of representation theory and combinatorics. We consider a conjecture of Jan Saxl stating that the tensor square of the $S_n$-irreducible representation indexed by the staircase partition contains every irreducible representation of $S_n$. We present a sufficient condition allowing to determine whether an irreducible representation is a constituent of a tensor square and using this result together with some analytic statements on partitions we prove Saxl conjecture for several partition classes. We also use Kronecker coefficients to give a new proof and a generalization of the unimodality of Gaussian ($q$-binomial) coefficients as polynomials in $q$, and extend this to strict unimodality.
We give a simple bijection between some staircase tableaux and tables of inversion. Some nice properties of the bijection allows us to define some q-Eulerian polynomials related to the staircase tableaux. We also give a combinatorial interpretation of these q-Eulerian polynomials in terms of permutations.
We define and consider $k$-distant crossings and nestings for matchings and set partitions, which are a variation of crossings and nestings in which the distance between vertices is important. By modifying an involution of Kasraoui and Zeng (Electronic J. Combinatorics 2006, research paper 33), we show that the joint distribution of $k$-distant crossings and nestings is symmetric. We also study the numbers of $k$-distant noncrossing matchings and partitions for small $k$, which are counted by well-known sequences, as well as the orthogonal polynomials related to $k$-distant noncrossing matchings and partitions. We extend Chen et al.'s $r$-crossings and enhanced $r$-crossings.
Surveying the results of three recent papers and some currently ongoing research, we show how a generalization of Brylawski's tensor product formula to colored graphs may be used to compute the Jones polynomial of some fairly complicated knots and, in the future, even virtual knots.
A shuffle of two words is a word obtained by concatenating the two original words in either order and then sliding any letters from the second word back past letters of the first word, in such a way that the letters of each original word remain spelled out in their original relative order. Examples of shuffles of the words $1234$ and $5678$ are, for instance, $15236784$ and $51236748$. In this paper, we enumerate the distinct shuffles of two permutations of any two lengths, where the permutations are written as words in the letters $1,2,3,\ldots ,m$ and $1,2,3,\ldots ,n$, respectively.