A formula of Lascoux-Leclerc-Thibon and representations of symmetric groups

We consider Green polynomials at roots of unity, corresponding to partitions which we call l-partitions. We obtain a combinatorial formula for Green polynomials corresponding to l-partitions at primitive lth roots of unity. The formula is rephrased in terms of representation theory of the symmetric group.     

The discrete logarithm problem from a local duality perspective

The discrete logarithm problem is analyzed from the perspective of Tate local duality. Local duality in the multiplicative case and the case of Jacobians of curves over p-adic local fields are considered. When the local field contains the necessary roots of unity, the case of curves over local fields is polynomial time reducible to the multiplicative case, and the multiplicative case is polynomial time equivalent to computing discrete logarithm in finite fields. When the local field does not contains the necessary roots of unity, similar results can be obtained at the cost of going to an extension that contains these roots of unity. There was evidence in the analysis that suggests that the minimal extension where the local duality can be rationally and algorithmically defined must contain the roots of unity. Therefore, the discrete logarithm problem appears to be well protected against an attack using local duality. These results are also of independent interest for algorithmic study of arithmetic duality as they explicitly relate local duality in the case of curves over local fields to the multiplicative case and Tate-Lichtenbaum pairing (over finite fields).     

Irreducible Representations of Quantum 3 × 3 Matrices

The irreducible representations of quantum 2×2 and 3×3 matrices at the roots of unity are classified.     

Green polynomials at roots of unity and Springer modules for the symmetric groups

We consider the Green polynomials at roots of unity. We obtain a recursive formula for the Green polynomials at roots of unity whose orders do not exceed some positive integer. The formula is described in a combinatorial manner. The coefficients of the recursive formula are realized by the cardinality of a set of permutations. The formula gives an interpretation of a combinatorial property on a family of graded modules for the symmetric group in terms of representation theory.     

Down-up algebras at roots of unity

In this note, we show that down-up algebras at roots of unity are maximal orders over their centers.

     

Mal'cev nilpotent algebras

We show that the Mal'cev semigroup identity x_n = y_n holds in the circle semigroup of an associative algebra over an infinite field precisely when the algebra is Lie nilpotent of class at most n. The Mal'cev semigroup law x_n = y_n holds in a group if and only if the group is nilpotent of class at most n.     

On the Number of Edges in Colour-Critical Graphs and Hypergraphs

A (hyper)graph G is called k-critical if it has chromatic number k, but every proper sub(hyper)graph of it is (k-1)-colourable. We prove that for sufficiently large k, every k-critical triangle-free graph on n vertices has at least (k-o(k))n edges. Furthermore, we show that every (k+1)-critical hypergraph on n vertices and without graph edges has at least (k-3/³?{k}) n(k-3/\sqrt[3]{k}) n edges. Both bounds differ from the best possible bounds by o(kn) even for graphs or hypergraphs of arbitrary girth.     

The determination of the thermal properties of a heat conductor in a nonlinear heat conduction problem

This paper considers the inverse determination of the positive unknown thermal properties K(T), C(T) and the unknown temperature T(_{x, t}) in the nonlinear transient heat conduction equation. In addition to prescribed initial and/or boundary values, specified continuously differentiable temperature data T(x₀, t) with non-zero derivative at a single sensor location x = x₀ is given. When K(T) and C(T) obey a certain relationship which enables one to linearise exactly the nonlinear heat equation then their dependence upon T is obtained explicitly, whilst the unknown temperature T(x, t) is obtained implicitly and is then calculated numerically. Results are presented and discussed for infinite, semi-infinite and finite slabs.     

Bireflectionality of orthogonal and symplectic groups of characteristic 2

Let V be a finite dimensional vector space over a field K of characteristic 2. Let O(V) be the orthogonal group defined by a nondegenerate quadratic form. Then every element in O(V) is a product of two elements of order 2, unless all nonsingular subspaces of V are at most 2-dimensional. If V is a nonsingular symplectic space, then every element in the symplectic group Sp (V) is a product of two elements of order 2, except if dim V = 2 and |K| = 2.     

Matroids and Graphs with Few Non-Essential Elements

An essential element of a 3-connected matroid M is one for which neither the deletion nor the contraction is 3-connected. Tutte's Wheels and Whirls Theorem proves that the only 3-connected matroids in which every element is essential are the wheels and whirls. In an earlier paper, the authors showed that a 3-connected matroid with at least one non-essential element has at least two such elements. This paper completely determines all 3-connected matroids with exactly two non-essential elements. Furthermore, it is proved that every 3-connected matroid M for which no single-element contraction is 3-connected can be constructed from a similar such matroid whose rank equals the rank in M of the set of elements e for which the deletion M\e is 3-connected.     

The VT-operator Semigroup for Two Kinds of Regular Semigroups

Let S be a regular semigroup and Con S the congruence lattice of S. For every rho element of Con S there exists a greatest congruence rhoV [smallest congruence rhov] on S such that the idempotent (rhoV/rho)-classes [(rho/rhov)-classes] are rectangular bands, and a greatest congruence rhoT [smallest congruence rhot] on S such that the idempotent (rhoT/rho-classes [(rho/rhot-classes] are groups. The subsemigroup of the transformation semigroup on Con S generated by the transformation rho → rhoV, rho → rhov, rho → rhoT, and rho → rhot, rho element of Con S, is investigated for orthodox semigroups and cryptogroups. It is shown that in this case this so-called Vt-operator semigroup Omega(S) contains 17 elements at most. A 17-element Vt-operator semigroup Omega(F) is realized for some regular orthogroup F.     

Hanlon and Stanley's Conjecture and the Milnor Fibre of a Braid Arrangement

Let A be a real arrangement of hyperplanes. Let B = B(q) be Varchenko's quantum bilinear form of A, introduced [15], specialized so that all hyperplanes have weight q. B(q) is nonsingular for all complex q except certain roots of unity. Here, we examine the kernel of B at roots of unity in relation to the topology of the hyperplane singularity.We use Varchenko's work [16] to relate B(q) to a Salvetti complex for the Milnor fibration of A. This paper's main result is specific to the arrangement of reflecting hyperplanes associated with the A _{n – 1} root system. We use a geometric property of the Milnor fibre to resolve a conjecture due to Hanlon and Stanley regarding the -module structure of the kernel of B(q) at certain roots of unity.     

The q-Characters at Roots of Unity

We consider various specializations of the untwisted quantum affine algebras at roots of unity. We define and study the q-characters of their finite-dimensional representations.     

On a family of non-unitarizable ribbon categories

We consider several families of categories. The first are quotients of H. Andersen’s tilting module categories for quantum groups of Lie type B at odd roots of unity. The second consists of categories of type BC constructed from idempotents in BMW-algebras. Our main result is to show that these families coincide as braided tensor categories using a recent theorem of Tuba and Wenzl. By appealing to similar results of Blanchet and Beliakova we obtain another interesting equivalence with these two families of categories and the quantum group categories of Lie type C at odd roots of unity. The morphism spaces in these categories can be equipped with a Hermitian form, and we are able to show that these categories are never unitary, and no braided tensor category sharing the Grothendieck semiring common to these families is unitarizable.     

On the existence of $\lambda $-projective splitters

Let D be an R-module over an arbitrary ring R of projective dimension at most 1. We construct an R-module G containing D such that Ext(D, G) = 0 = Ext(G, G). Moreover, we show that if D is l\lambda -projective over a hereditary ring R, for some infinite cardinal l\lambda , then G is also l\lambda -projective.     

Pál-type Birkhoff interpolation on nonuniformly distributed points

We study here the regularity of certain Pál-type interpolation problems involving the mth roots of unity along with an additional point ζ and the nth roots of unity. We determine the largest domains for ζ which ensure the regularity of the problems. AMS subject classification 41A05     

Finding Large p-Colored Diameter Two Subgraphs

Given a coloring of the edges of the complete graph K on n vertices in k colors, a p-colored subgraph of K_n is any subgraph whose edges only use colors from some p element set. We show for k̿ and k\2hphk that there is always a p-colored diameter two subgraph of K_n containing at least [((k+p)n)/(2k)]\displaystyle{(k+p)n \over 2k} vertices and that this is best possible up to an additive constant l satisfying 0hl<k\2.     

Group-invariant Percolation on Graphs

Let G be a closed group of automorphisms of a graph X. We relate geometric properties of G and X, such as amenability and unimodularity, to properties of G-invariant percolation processes on X, such as the number of infinite components, the expected degree, and the topology of the components. Our fundamental tool is a new masstransport technique that has been occasionally used elsewhere and is developed further here.¶ Perhaps surprisingly, these investigations of group-invariant percolation produce results that are new in the Bernoulli setting. Most notably, we prove that critical Bernoulli percolation on any nonamenable Cayley graph has no infinite clusters. More generally, the same is true for any nonamenable graph with a unimodular transitive automorphism group.¶ We show that G is amenable if for all $ \alpha < 1 $ \alpha < 1 , there is a G-invariant site percolation process w \omega on X with $ {\bf P} [x \in \omega] > \alpha $ {\bf P} [x \in \omega] > \alpha for all vertices x and with no infinite components. When G is not amenable, a threshold $ \alpha < 1 $ \alpha < 1 appears. An inequality for the threshold in terms of the isoperimetric constant is obtained, extending an inequality of Häggström for regular trees.¶ If G acts transitively on X, we show that G is unimodular if the expected degree is at least 2 in any G-invariant bond percolation on X with all components infinite.¶ The investigation of dependent percolation also yields some results on automorphism groups of graphs that do not involve percolation.     

Helly-type theorems for appropriate colorings of visibility sets

Summary. For positive integers q and n, think of P as the vertex set of a (qn + r)-gon, 0 ￡ r ￡ q - 1 0 \leq r \leq q - 1 . For 1 ￡ i ￡ qn + r 1 \leq i \leq qn + r , define V(i) to be a set of q consecutive points of P, starting at p(i), and let S be a subset of {V(i) : 1 ￡ i ￡ qn + r } \lbrace V(i) : 1 \leq i \leq qn + r \rbrace . A q-coloring of P = P(q) such that each member of S contains all q colors is called appropriate for S, and when 1 ￡ j ￡ q 1 \leq j \leq q , the definition may be extended to suitable subsets P(j) of P. If for every 1 ￡ j ￡ q 1 \leq j \leq q and every corresponding P(j), P(j) has a j-coloring appropriate for S, then we say P = P(q) has all colorings appropriate for S. With this terminology, the following Helly-type result is established: Set P = P(q) has all colorings appropriate for S if and only if for every (2n + 1)-member subset T of S, P has all colorings appropriate for T. The number 2n + 1 is best possible for every r 3 1 r \geq 1 . Intermediate results for q-colorings are obtained as well.