Coquasitriangular Hopf group coalgebras and braided monoidal categories

Let ?? be a group, and let H be a Hopf ??-coalgebra. We first show that the category M ^H of right ??-comodules over H is a monoidal category and there is a monoidal endofunctor (F _?? , id, id) of M ^H for any ?? ?? ??. Then we give the definition of coquasitriangular Hopf ??-coalgebras. Finally, we show that H is a coquasitriangular Hopf ??-coalgebra if and only if M ^H is a braided monoidal category and (F _?? , id, id) is a braided monoidal endofunctor of M ^H for any ?? ?? ??.     

Center construction and duality of category of Hom-Yetter-Drinfeld modules over monoidal Hom-Hopf algebras

Let (H,α) be a monoidal Hom-Hopf algebra. In this paper, we will study the category of Hom-Yetter-Drinfeld modules. First, we show that the category of left-left Hom-Yetter-Drinfeld modules _H^HH Y D is isomorphic to the center of the category of left (H,α)-Hom-modules. Also, by the center construction, we get that the categories of left-left, left-right, right-left, and right-right Hom-Yetter-Drinfeld modules are isomorphic as braided monoidal categories. Second, we prove that the category of finitely generated projective left-left Hom-Yetter-Drinfeld modules has left and right duality.     

Quantum doubles in monoidal categories

Let H be a Hopf algebra in a rigid symmetric monoidal category C then the evaluation map τis a convolution-invertible skew pairing. In the previous paper, we constructed a Hopf algebra D(H)=H ? _r H ^?cop in C. In this paper, we first show that D(H) is a quasitriangular Hopf algebra in C. Next, let H be an ordinary triangular finite-dimensional Hopf algebra. Then one can form quasitriangular Hopf algebras B(H,H) and B(H,D(H)) (in a rigid braided monoidal category) by Majid’s method associated to the ordinary Hopf algebra maps H →H and i_H H → D(H), where D(H) is the Drin-fePd quantum double. We show that D (B(H,H)) and B(H,D(H)) are isomorphic Hopf algebras in the braided monoidal category.     

Closed structures on categories of topological spaces

The category of all topological spaces and continuous maps and its full subcategory of all T_o-spaces admit (up to isomorphism) precisely one structure of symmetric monoidal closed category (see [2]). In this paper we shall prove the same result for any epireflective subcategory of the category of topological spaces (particularly e.g. for the categories of Hausdorff spaces, regular spaces, Tychonoff spaces).     

Cohomology and coquasi-bialgebra extensions associated to a matched pair of bialgebras

By using braid diagrams, we explicitly reconstruct the cohomology associated to a matched pair of cocommutative bialgebras, in order to give a method of constructing coquasi-bialgebras, which generalize bialgebras, and classifying them up to monoidal equivalence of their comodule categories. An alternative, homological proof is given for Schauenburg's generalized Kac Sequence involving the abelian group Opext(H,K) of bialgebra extensions. We define an abelian group, Opext″(H,K), of coquasi-bialgebra extensions associated to a Singer pair (H,K) of bialgebras, and prove a variant of Schauenburg's sequence which involves the group. It is also proved that there is a natural isomorphism that preserves monoidal equivalence classes, if (H₁,K) and (H₂,K) arise from such matched pairs that are shifts of each other.     

Inequalities for the Polar Derivative of a Polynomial

Let P(z) be a polynomial of degree at most n. We consider an operator D _?? which maps a polynomial P(z) into D _?? P(z) :=?nP(z)?+?(?? ? z)P??(z) and prove results concerning the estimates of |D _?? P(z)| on the disk |z|?=?R??? 1, and thereby obtain extensions and generalizations of a number of well-known polynomial inequalities.     

Polynomial cases of graph decomposition: A complete solution of Holyer’s problem

Let H be a fixed graph. A graph G has an H-decomposition if the edge set of G can be partitioned into subsets inducing graphs isomorphic to H. Let P_H denote the following decision problem: “Does an instance graph G admit H-decomposition?” In this paper we prove that the problem P_H is polynomial time solvable if H is a graph whose every component has at most 2 edges. This way we complete a solution of Holyer’s problem which is the problem of classifying the problems P_H according to their computational complexities.     

Weak infinitesimal Hilbert’s 16th problem

The following weak infinitestimal Hilbert’s 16th problem is solved. Given a real polynomial H in two variables, denote by M(H, m) the maximal number possessing the following property: for any generic set {γ _i } of at most M(H,m) compact connected components of the level lines H = c _i of the polynomial H, there exists a form θ = P dx + Q dy with polynomials P and Q of degrees no greater than m such that the integral ∫ _H=c θ has nonmultiple zeros on the connected components {γ _i }. An upper bound for the number M(H,m) in terms of the degree n of the polynomial H is found; this estimate is sharp for almost every polynomial H of degree n. A multidimensional version of this result is proved. The relation between the weak infinitesimal Hilbert’s 16th problem and the following question is discussed: How many limit cycles can a polynomial vector field of degree n have if it is close to a Hamiltonian vector field?     

A polynomial dual of partitions

Let P(x) = Σ_i=0ⁿa_ixⁱ be a nonnegative integral polynomial. The polynomial P(x) is m-graphical, and a multi-graph G a realization of P(x), provided there exists a multi-graph G containing exactly P(1) points where a_i of these points have degree i for 0≤i≤n. For multigraphs G, H having polynomials P(x), Q(x) and number-theoretic partitions (degree sequences) π, ?, the usual product P(x)Q(x) is shown to be the polynomial of the Cartesian product G × H, thus inducing a natural product π? which extends that of juxtaposing integral multiple copies of ?. Skeletal results are given on synthesizing a multi-graph G via a natural Cartesian product G₁ × … × G_k having the same polynomial (partition) as G. Other results include an elementary sufficient condition for arbitrary nonnegative integral polynomials to be graphical.     

Symmetric Jacobians

This article is about polynomial maps with a certain symmetry and/or antisymmetry in their Jacobians, and whether the Jacobian Conjecture is satisfied for such maps, or whether it is sufficient to prove the Jacobian Conjecture for such maps. For instance, we show that it suffices to prove the Jacobian conjecture for polynomial maps x + H over ? such that satisfies all symmetries of the square, where H is homogeneous of arbitrary degree d ≥ 3.     

The Brauer-Clifford Group for (S,H)-Azumaya Algebras over a Commutative Ring

The Brauer-Clifford group BrClif(Z,G) corresponding to a finite group G and a finite-dimensional semisimple G-algebra Z was recently introduced by Alexandre Turull in the course of his work on character correspondence conjectures in group representation theory. This Brauer-Clifford group is a group of equivalence classes of Azumaya algebras over Z whose G-algebra structure agrees on restriction to the fixed (and usually nontrivial) G-algebra structure of Z. In this paper we extend the notion of the Brauer-Clifford group to the case of (S,H)-Azumaya algebras, when H is a cocommutative Hopf algebra and S is a commutative H-module algebra. These Brauer-Clifford groups turn out to be an example of the Brauer group of the symmetric monoidal category of S # H-modules, a perspective which allows one to construct a dual Brauer-Clifford group for the category of S-modules with compatible right H-comodule structure.     

Regular orientable imbeddings of complete graphs

This paper classifies the regular imbeddings of the complete graphs K_n in orientable surfaces. Biggs showed that these exist if and only if n is a prime power p^e, his examples being Cayley maps based on the finite field F = GF(n). We show that these are the only examples, and that there are $\text{φ(n ? 1)}\text{e}$ isomorphism classes of such maps (where φ is Euler's function), each corresponding to a conjugacy class of primitive elements of F, or equivalently to an irreducible factor of the cyclotomic polynomial Φ_{n ? 1}(z) over GF(p). We show that these maps are all equivalent under Wilson's map-operations H_i, and we determined for which n they are reflexible or self-dual.     

Hom-tensor relations for (quasi-) comodule algebras

We discuss quasi-Hopf algebras as introduced by Drinfeld and generalize the Hom-tensor adjunctions from the Hopf case to the quasi-Hopf setting, making the module category over a quasi-Hopf algebra H into a biclosed monoidal category. However, in this case, the unit and counit of the adjunction are not trivial and should be suitably modified in terms of the reassociator and the quasi-antipode of the quasi-Hopf algebra H. In a more general case, for a comodule algebra $ \mathcal{B} $ over a quasi-Hopf algebra H, the module category over $ \mathcal{B} $ need not to be monoidal. However, there is an action of a monoidal category on it. Using this action, we consider some kind of tensor and Hom-endofunctors of module category over $ \mathcal{B} $ and generalize some Hom-tensor relations from module category on H to this module category.     

An equivariant tensor product on Mackey functors

For all subgroups H of a cyclic p-group G we define norm functors that build a G-Mackey functor from an H-Mackey functor. We give an explicit construction of these functors in terms of generators and relations based solely on the intrinsic, algebraic properties of Mackey functors and Tambara functors. We use these norm functors to define a monoidal structure on the category of Mackey functors where Tambara functors are the commutative ring objects.     

Chromaticity of certain tripartite graphs identified with a path

For a graph G, let P(G) be its chromatic polynomial. Two graphs G and H are chromatically equivalent if P(G)=P(H). A graph G is chromatically unique if P(H)=P(G) implies that H≅G. In this paper, we classify the chromatic classes of graphs obtained from K_2,2,2∪P_m(m?3), (K_2,2,2-e)∪P_m(m?5) and (K_2,2,2-2e)∪P_m(m?6) by identifying the end-vertices of the path P_m with any two vertices of K_2,2,2, K_2,2,2-e and K_2,2,2-2e, respectively, where e and 2e are, respectively, an edge and any two edges of K_2,2,2. As a by-product of this, we obtain some families of chromatically unique and chromatically equivalent classes of graphs.     

Explicit subspace designs

A subspace design is a collection {H ₁, H ₂, ...,H _M } of subspaces of \(\mathbb{F}_q^m\) with the property that no low-dimensional subspace W of \(\mathbb{F}_q^m\) intersects too many subspaces of the collection. Subspace designs were introduced by Guruswami and Xing (STOC 2013) who used them to give a randomized construction of optimal rate list-decodable codes over constant-sized large alphabets and sub-logarithmic (and even smaller) list size. Subspace designs are the only non-explicit part of their construction. In this paper, we give explicit constructions of subspace designs with parameters close to the probabilistic construction, and this implies the first deterministic polynomial time construction of list-decodable codes achieving the above parameters.Our constructions of subspace designs are natural and easily described, and are based on univariate polynomials over finite fields. Curiously, the constructions are very closely related to certain good list-decodable codes (folded RS codes and univariate multiplicity codes). The proof of the subspace design property uses the polynomial method (with multiplicities): Given a target low-dimensional subspace W, we construct a nonzero low-degree polynomial P _W that has several roots for each H _i that non-trivially intersects W. The construction of P _W is based on the classical Wronskian determinant and the folded Wronskian determinant, the latter being a recently studied notion that we make explicit in this paper. Our analysis reveals some new phenomena about the zeroes of univariate polynomials, namely that polynomials with many structured roots or many high multiplicity roots tend to be linearly independent.     

Quantum commutative algebras and their duals

If an algebraA is quantum commutative with respect to the action of a quasitriangular Hopf algebraH, then the monoidal structure on the category_H ^ℳ of modules overH induces a rnonoidal structure on the category_A#H ^ℳ of modules over the associated smash productA # H. The condition under which the braiding structure of_H ^ℳ induces a braiding structure on_A#H ^ℳ is further investigated. Dually, the notion of quantum cocommutativity is introduced, and similar result in this dual situation is obtained.     

Incidence categories

Given a family F of posets closed under disjoint unions and the operation of taking convex subposets, we construct a category C_F called the incidence category ofF. This category is “nearly abelian” in the sense that all morphisms have kernels/cokernels, and possesses a symmetric monoidal structure akin to direct sum. The Ringel-Hall algebra of C_F is isomorphic to the incidence Hopf algebra of the collection P(F) of order ideals of posets in F. This construction generalizes the categories introduced by K. Kremnizer and the author, in the case when F is the collection of posets coming from rooted forests or Feynman graphs.