Liftings of graded quasi-Hopf algebras with radical of prime codimension

Let p be a prime, and let RG(p) denote the set of equivalence classes of radically graded finite dimensional quasi-Hopf algebras over C, whose radical has codimension p. The purpose of this paper is to classify finite dimensional quasi-Hopf algebras A whose radical is a quasi-Hopf ideal and has codimension p; that is, A with gr(A) in RG(p), where gr(A) is the associated graded algebra taken with respect to the radical filtration on A. The main result of this paper is the following theorem: Let A be a finite dimensional quasi-Hopf algebra whose radical is a quasi-Hopf ideal of prime codimension p. Then either A is twist equivalent to a Hopf algebra, or it is twist equivalent to H(2), H_±(p), A(q), or H(32), constructed in [5] and [8]. Note that any finite tensor category whose simple objects are invertible and form a group of order p under tensor is the representation category of a quasi-Hopf algebra A as above. Thus this paper provides a classification of such categories.     

A weak discrete maximum principle for hp-FEM

In this paper, we prove a new discrete maximum principle (DMP) for the one-dimensional Poisson equation discretized by the hp-FEM. While the DMP for piecewise-linear elements is a classical result from the 1970s, no extensions to hp-FEM are available to the present day. Due to a negative result by Höhn and Mittelmann from 1981, related to quadratic Lagrange elements, it was long assumed that higher-order finite elements do not satisfy discrete maximum principles. In this paper we explain why it is not possible to make a straightforward extension of the classical DMP to the higher-order case, and we propose stronger assumptions on the right-hand side under which an extension is possible.     

Smoothness of generalized solutions for higher-order elliptic equations with nonlocal boundary conditions

The smoothness of generalized solutions for higher-order elliptic equations with nonlocal boundary conditions is studied in plane domains. Necessary and sufficient conditions upon the right-hand side of the problem and nonlocal operators under which the generalized solutions possess an appropriate smoothness are established.     

Projective modules over the Gerasimov–Sakhaev counterexample

We investigate the structure of the so-called Gerasimov–Sakhaev counterexample, which is a particular example of a universal localization, and classify (both finitely and infinitely generated) projective modules over it.     

Systems of sets with multiplicative asymptotic density

The authors define a notion of system of sets with multiplicative asymptotic density in this paper. A criterion and one necessary condition for a given system {A _i } _i=1^∞ to be a system with multiplicative asymptotic density is given. Properties of certain special types of systems of sets with multiplicative asymptotic density are treated. This work is supported by The Ministry of Education, Youth and Sports of the Czech Republic. Project CQR 1M06047.     

Spanning forests and the golden ratio

For a graph G, let f_ij be the number of spanning rooted forests in which vertex j belongs to a tree rooted at i. In this paper, we show that for a path, the f_ij's can be expressed as the products of Fibonacci numbers; for a cycle, they are products of Fibonacci and Lucas numbers. The doubly stochastic graph matrix is the matrix F=(f_ij)_n×n/f, where f is the total number of spanning rooted forests of G and n is the number of vertices in G. F provides a proximity measure for graph vertices. By the matrix forest theorem, F^-1=I+L, where L is the Laplacian matrix of G. We show that for the paths and the so-called T-caterpillars, some diagonal entries of F (which provide a measure of the self-connectivity of vertices) converge to φ^-1 or to 1-φ^-1, where φ is the golden ratio, as the number of vertices goes to infinity. Thereby, in the asymptotic, the corresponding vertices can be metaphorically considered as “golden introverts” and “golden extroverts,” respectively. This metaphor is reinforced by a Markov chain interpretation of the doubly stochastic graph matrix, according to which F equals the overall transition matrix of a random walk with a random number of steps on G.