Support varieties, AR-components, and good filtrations

Let G be a reductive group, defined over the Galois field ${\mathbb{F}_p}$ with p being good for G. Using support varieties and covering techniques based on G _r T-modules, we determine the position of simple modules and baby Verma modules within the stable Auslander?CReiten quiver ?? _s (G _r ) of the rth Frobenius kernel of G. In particular, we show that the almost split sequences terminating in these modules usually have an indecomposable middle term. Concerning support varieties, we introduce a reduction technique leading to isomorphisms $$\mathcal{V}_{G_r}(Z_r(\lambda)) \cong \mathcal{V}_{G_{r-d}}(Z_{r-d}(\mu))$$ for baby Verma modules of certain highest weights ${\lambda, \mu \in X(T)}$ , which are related by the notion of depth.     

Decomposition of Tensor Products Involving a Steinberg Module

We study the decomposition of tensor products between a Steinberg module and a costandard module, both as a module for the algebraic group G and when restricted to either a Frobenius kernel G _r or a finite Chevalley group \(G(\mathbb {F}_q)\). In all three cases, we give formulas reducing this to standard character data for G. Along the way, we use a bilinear form on the characters of finite dimensional G-modules to give formulas for the dimension of homomorphism spaces between certain G-modules when restricted to either G _r or \(G(\mathbb {F}_q)\). Further, this form allows us to give a new proof of the reciprocity between tilting modules and simple modules for G which has slightly weaker assumptions than earlier such proofs. Finally, we prove that in a suitable formulation, this reciprocity is equivalent to Donkin’s tilting conjecture.     

The Chartrand-Schuster conjecture: Graphs with unique distance trees are regular

Let G be a finite connected graph with no cut vertex. A distance tree T is a spanning tree of G which further satisfies the condition that for some vertex v, d_G(v, u) = d_T(v, u) for all u, where d_G(v, u) denotes the distance of u from v in the graph G. The conjecture that if all distance trees of G are isomorphic to each other then G is a regular graph, is settled affirmatively. The conjecture was made by Chartrand and Schuster.     

Actions of totally disconnected groups and equivariant singular homology

We study equivariant singular homology in the case of actions of totally disconnected locally compact groups on topological spaces. Theorem A says that if G is a totally disconnected locally compact group and X is a G-space, then any short exact sequence of covariant coefficient systems for G induces a long exact sequence of corresponding equivariant singular homology groups of the G-space X. In particular we consider the case where G is a totally disconnected compact group, i.e., a profinite group, and G acts freely on X. Of special interest is the case where G is a p-adic group, p a prime. The conjecture that no p-adic group, p a prime, can act effectively on a connected topological manifold, is namely known to be equivalent to the famous Hilbert-Smith conjecture. The Hilbert-Smith conjecture is the statement that, if a locally compact group G acts effectively on a connected topological manifold M, then G is a Lie group.     

Isomorphism of circulant graphs and digraphs

Let S? {1, …, n?1} satisfy ?S = S mod n. The circulant graph G(n, S) with vertex set {v₀, v₁,…, v_n?1} and edge set E satisfies v_iv_j?E if and only if j ? i ∈ S, where all arithmetic is done mod n. The circulant digraph G(n, S) is defined similarly without the restriction S = ? S. Ádám conjectured that $\text{G(n, S) ? G(n, S′)}$ if and only if S = uS′ for some unit u mod n. In this paper we prove the conjecture true if n = pq where p and q are distinct primes. We also show that it is not generally true when n = p², and determine exact conditions on S that it be true in this case. We then show as a simple consequence that the conjecture is false in most cases when n is divisible by p² where p is an odd prime, or n is divisible by 2⁴.     

A Counter-Example to Martino’s Conjecture About Generic Calogero–Moser Families

The Calogero–Moser families are partitions of the irreducible characters of a complex reflection group derived from the block structure of the corresponding restricted rational Cherednik algebra. It was conjectured by Martino in 2009 that the generic Calogero–Moser families coincide with the generic Rouquier families, which are derived from the corresponding Hecke algebra. This conjecture is already proven for the whole infinite series G(m,p,n) and for the exceptional group G ₄. A combination of theoretical facts with explicit computations enables us to determine the generic Calogero–Moser families for the nine exceptional groups G ₄, G ₅, G ₆, G ₈, G ₁₀, G ₂₃?=?H ₃, G ₂₄, G ₂₅, and G ₂₆. We show that the conjecture holds for all these groups—except surprisingly for the group G ₂₅, thus being the first and only-known counter-example so far.     

Breuil modules for Raynaud schemes

Let p be an odd prime, and let OK be the ring of integers in a finite extension K/Qp. Breuil has classified finite flat group schemes of type (p,…,p) over OK in terms of linear-algebraic objects that have come to be known as Breuil modules. This classification can be extended to the case of finite flat vector space schemes G over OK. When G has rank one, the generic fiber of G corresponds to a Galois character, and we explicitly determine this character in terms of the Breuil module of G. Special attention is paid to Breuil modules with descent data corresponding to characters of that become finite flat over a totally ramified extension of degree pd−1; these arise in Gee's work on the weight in Serre's conjecture over totally real fields.

Video abstract

For a video summary of this paper, please visit http://www.youtube.com/watch?v=9oWYJy_XrZE.     

Maximizing a lower bound on the computational complexity

We solve a combinatorial problem that arises in determining by a method due to Engeler lower bounds for the computational complexity of algorithmic problems. Denote by G_d the class of permutation groups G of degree d that are iterated wreath products of symmetric groups, i.e. G = S_dh?11?1S_d0 with Π^h?1_i=0d_i = d for some natural number h and some sequence (d₀,…,d_h?1) of natural numbers greater than 1. The problem is to characterize those G = S_dh?11?1S_d0 in G_d on which k(G):=log|G|/max_0≤i≤h?1log(d_i!) assumes its maximum. Our solution consists of two necessary conditions for this, namely that d₀≤d₁≤?≤d_h and that d_h is the largest prime divisor of d. Consequently, if d is a prime power, say d = p^h with p prime, then a necessary and sufficient condition is that d_i = p, 0 ≤ i ≤ h ? 1.     

On the generalized lower bound conjecture for polytopes and spheres

In 1971, McMullen and Walkup posed the following conjecture, which is called the generalized lower bound conjecture: If P is a simplicial d-polytope then its h-vector (h ₀, h ₁, …, h _d ) satisfies $ {h_0}\leq {h_1}\leq \ldots \leq {h_{{\left\lfloor {{d \left/ {2} \right.}} \right\rfloor }}} $ . Moreover, if h _r?1 = h _r for some $ r\leq \frac{1}{2}d $ then P can be triangulated without introducing simplices of dimension ≤d ? r. The first part of the conjecture was solved by Stanley in 1980 using the hard Lefschetz theorem for projective toric varieties. In this paper, we give a proof of the remaining part of the conjecture. In addition, we generalize this result to a certain class of simplicial spheres, namely those admitting the weak Lefschetz property.     

Graham’s pebbling conjecture on product of thorn graphs of complete graphs

The pebbling number of a graph G, f(G), is the least n such that, no matter how n pebbles are placed on the vertices of G, we can move a pebble to any vertex by a sequence of pebbling moves, each move taking two pebbles off one vertex and placing one on an adjacent vertex. Let p₁,p₂,…,p_n be positive integers and G be such a graph, V(G)=n. The thorn graph of the graph G, with parameters p₁,p₂,…,p_n, is obtained by attaching p_i new vertices of degree 1 to the vertex u_i of the graph G, i=1,2,…,n. Graham conjectured that for any connected graphs G and H, f(G×H)≤f(G)f(H). We show that Graham’s conjecture holds true for a thorn graph of the complete graph with every by a graph with the two-pebbling property. As a corollary, Graham’s conjecture holds when G and H are the thorn graphs of the complete graphs with every .     

On the Hadwiger's conjecture for graph products

The Hadwiger number η(G) of a graph G is the largest integer h such that the complete graph on h nodes K_h is a minor of G. Equivalently, η(G) is the largest integer such that any graph on at most η(G) nodes is a minor of G. The Hadwiger's conjecture states that for any graph G, η(G)?χ(G), where χ(G) is the chromatic number of G. It is well-known that for any connected undirected graph G, there exists a unique prime factorization with respect to Cartesian graph products. If the unique prime factorization of G is given as G₁□G₂□?□G_k, where each G_i is prime, then we say that the product dimension of G is k. Such a factorization can be computed efficiently.In this paper, we study the Hadwiger's conjecture for graphs in terms of their prime factorization. We show that the Hadwiger's conjecture is true for a graph G if the product dimension of G is at least . In fact, it is enough for G to have a connected graph M as a minor whose product dimension is at least , for G to satisfy the Hadwiger's conjecture. We show also that if a graph G is isomorphic to F^d for some F, then η(G)?χ(G)^{⌊(d-1)/2⌋}, and thus G satisfies the Hadwiger's conjecture when d?3. For sufficiently large d, our lower bound is exponentially higher than what is implied by the Hadwiger's conjecture.Our approach also yields (almost) sharp lower bounds for the Hadwiger number of well-known graph products like d-dimensional hypercubes, Hamming graphs and the d-dimensional grids. In particular, we show that for the d-dimensional hypercube H_d, . We also derive similar bounds for G^d for almost all G with n nodes and at least edges.     

An upper bound for the competition numbers of graphs

A hole of a graph is an induced cycle of length at least 4. Kim (2005) [2] conjectured that the competition number k(G) is bounded by h(G)+1 for any graph G, where h(G) is the number of holes of G. In Lee et al. [3], it is proved that the conjecture is true for a graph whose holes are mutually edge-disjoint. In Li et al. (2009) [4], it is proved that the conjecture is true for a graph, all of whose holes are independent. In this paper, we prove that Kim’s conjecture is true for a graph G satisfying the following condition: for each hole C of G, there exists an edge which is contained only in C among all induced cycles of G.     

On a cycle partition problem

Let G be any graph and let c(G) denote the circumference of G. We conjecture that for every pair c₁,c₂ of positive integers satisfying c₁+c₂=c(G), the vertex set of G admits a partition into two sets V₁ and V₂, such that V_i induces a graph of circumference at most c_i, i=1,2. We establish various results in support of the conjecture; e.g. it is observed that planar graphs, claw-free graphs, certain important classes of perfect graphs, and graphs without too many intersecting long cycles, satisfy the conjecture.This work is inspired by a well-known, long-standing, analogous conjecture involving paths.     

Thompson’s conjecture for the alternating group of degree 2<Emphasis Type="Italic">p</Emphasis> and 2<Emphasis Type="Italic">p</Emphasis>+1

For a finite group G denote by N(G) the set of conjugacy class sizes of G. In 1980s, J.G.Thompson posed the following conjecture: If L is a finite nonabelian simple group, G is a finite group with trivial center and N(G) = N(L), then G ? L. We prove this conjecture for an infinite class of simple groups. Let p be an odd prime. We show that every finite group G with the property Z(G) = 1 and N(G) = N(A _i ) is necessarily isomorphic to A _i , where i ∈ {2p, 2p + 1}.     

Positive solutions of <Emphasis Type="Italic">p</Emphasis>-th Yamabe type equations on graphs

Let G = (V,E) be a finite connected weighted graph, and assume 1 ? α ? p ? q. In this paper, we consider the p-th Yamabe type equation ―?_pu+hu^q―1 = λfu^α―1 on G, where ?_p is the p-th discrete graph Laplacian, h < 0 and f > 0 are real functions defined on all vertices of G. Instead of H. Ge’s approach [Proc. Amer. Math. Soc., 2018, 146(5): 2219–2224], we adopt a new approach, and prove that the above equation always has a positive solution u > 0 for some constant λ ∈ ?. In particular, when q = p, our result generalizes Ge’s main theorem from the case of α ? p > 1 to the case of 1 ? α ? p, It is interesting that our new approach can also work in the case of α ? p > 1.     

On Lie algebra decompositions related to spherical homogeneous spaces

LetG be a connected, reductive, linear algebraic group over an algebraically closed fieldk of characteristik zero. LetH ₁ andH ₂ be two spherical subgroups ofG. It is shown that for allg in a Zariski open subset ofG one has a Lie algebra decomposition g = h₁ + Adg ? h₂, where a is the Lie algebra of a torus and dim a ≤ min (rankG/H ₁,rankG/H ₂). As an application one obtains an estimate of the transcendence degree of the fieldk(G/H ₁ xG/H ₂) ^G for the diagonal action ofG. Ifk = ? andG _a is a real form ofG defined by an antiholomorphic involution σ :G→G then for a spherical subgroup H ? G and for allg in a Hausdorff open subset ofG one has a decomposition g = g_a + a Adg ? h, where a is the Lie algebra of σ-invariant torus and dim a ≤ rankG/H.     

Dynamic list coloring of bipartite graphs

A dynamic coloring of a graph is a proper coloring of its vertices such that every vertex of degree more than one has at least two neighbors with distinct colors. The least number of colors in a dynamic coloring of G, denoted by χ₂(G), is called the dynamic chromatic number of G. The least integer k, such that if every vertex of G is assigned a list of k colors, then G has a proper (resp. dynamic) coloring in which every vertex receives a color from its own list, is called the choice number of G, denoted by ch(G) (resp. the dynamic choice number, denoted by ch₂(G)). It was recently conjectured (Akbari et al. (2009) [1]) that for any graph G, ch₂(G)=max(ch(G),χ₂(G)). In this short note we disprove this conjecture. We first give an example of a small planar bipartite graph G with ch(G)=χ₂(G)=3 and ch₂(G)=4. Then, for any integer k≥5, we construct a bipartite graph G_k such that ch(G_k)=χ₂(G_k)=3 and ch₂(G)≥k.     

On the cosets of the 2q-power group in the unit group modulop

Letp be a prime number ≡ 3 mod 4,G ^p the unit group of ?/p?, andg a generator ofG _p. Letq be an odd divisor ofp - 1 andG _p ^2q = {t ^2q;t ∈G _pthe subgroup of index2q inG _p. The groupG _p ² / _p ^2q consists of the classes \(\bar g^{2j} \) ,j = 0,...,q – 1. In this paper we study the ’excesses’ of the classes \(\bar g^{2j} \) in {l,...,(_p–l)/2}, i.e., the numbers \(\Phi _j = \left| {\left\{ {k;1 \leqslant k \leqslant \left( {p - 1} \right)/2,\bar k \in \bar g^{2j} } \right\}} \right| - \left| {\left\{ {k;\left( {p - 1} \right)/2 \leqslant k \leqslant p - 1,\bar k \in \bar g^{2j} } \right\}} \right|\) ,j = 0.....q — 1. First we express therelative class number h _2q of the subfieldK _2q? ?(e^2#x03C0;i/p ) of degree [K _2q: ?] =2q in terms of these excesses. We use this formula to establish certaincongruences for the Ф^j. E.g., ifq ∈ {3,5,11}, each number Фj is congruent modulo 4 to each other iff 2 dividesh _2q ^- . Finally we study thevariance of the excesses, i.e., the number \(\sigma ^2 = ((\Phi _0 - \hat \Phi )^2 + \ldots + (\Phi _{q - 1} - \hat \Phi )^2 )/(q - 1)\) , where \(\hat \Phi \) is the mean value of the numbers Ф_j. We obtain an explicit lower bound for σ² in terms ofh _2q ^- /h ₂ ^- . Moreover, we show that log σ² is asymptotically equal to 21og(h _2q ^- h ₂ ^- )/(q - 1) forp→∞. Three tables illustrate the results.     

Broué's conjecture for non-principal 3-blocks of finite groups

In representation theory of finite groups, there is a well-known and important conjecture due to M. Broué. He conjectures that, for any prime p, if a p-block A of a finite group G has an abelian defect group D, then A and its Brauer correspondent p-block B of N_G(D) are derived equivalent. We demonstrate in this paper that Broué's conjecture holds for two non-principal 3-blocks A with elementary abelian defect group D of order 9 of the O'Nan simple group and the Higman-Sims simple group. Moreover, we determine these two non-principal block algebras over a splitting field of characteristic 3 up to Morita equivalence.