Totally reflexive modules with respect to a semidualizing bimodule

Let S and {iaR} be two associative rings, let _S C _R be a semidualizing (S,R)-bimodule. We introduce and investigate properties of the totally reflexive module with respect to _S C _R and we give a characterization of the class of the totally C _R -reflexive modules over any ring R. Moreover, we show that the totally C _R -reflexive module with finite projective dimension is exactly the finitely generated projective right R-module. We then study the relations between the class of totally reflexive modules and the Bass class with respect to a semidualizing bimodule. The paper contains several results which are new in the commutative Noetherian setting.     

Ordering of risks: a review

In this review we will consider and discuss the most important partial orderings of riks, namely consistent partial ordering and net-stop-loss ordering. More especially we will study the consequencies of ordering of risks for the compound risk: S = X₁+X₂+···+X_N.The impact of orderings of claim size distributions (F_X) and claim intensities (F_N) on orderings of claim amounts (F_S) is examined. The consequencies of these kind of orderings on orderings of risks by means of premium calculation principles is also discussed.In this framework the influence of the dangerousness of distributions on orderings of risks is given.In analogy with the notion of stochastic dominance appearing in the theory of finance, the notion of stop-loss dominance is introduced.     

Join-semidistributive lattices and convex geometries

We introduce the notion of a convex geometry extending the notion of a finite closure system with the anti-exchange property known in combinatorics. This notion becomes essential for the different embedding results in the class of join-semidistributive lattices. In particular, we prove that every finite join-semidistributive lattice can be embedded into a lattice S_P(A) of algebraic subsets of a suitable algebraic lattice A. This latter construction, S_P(A), is a key example of a convex geometry that plays an analogous role in hierarchy of join-semidistributive lattices as a lattice of equivalence relations does in the class of modular lattices. We give numerous examples of convex geometries that emerge in different branches of mathematics from geometry to graph theory. We also discuss the introduced notion of a strong convex geometry that might promise the development of rich structural theory of convex geometries.     

On Holographic Structures

We introduce and study the class of holographic models which can be defined by copying of some of its finite parts by means of automorphisms. We prove this class to differ from the class of countably categorical models. Characterizations of the classes of holographic Boolean algebras, abelian groups, linear orderings, fields, and equivalences are given.

     

Perverse coherent sheaves and the geometry of special pieces in the unipotent variety

Let X be a scheme of finite type over a Noetherian base scheme S admitting a dualizing complex, and let U⊂X be an open set whose complement has codimension at least 2. We extend the Deligne-Bezrukavnikov theory of perverse coherent sheaves by showing that a coherent intermediate extension (or intersection cohomology) functor from perverse sheaves on U to perverse sheaves on X may be defined for a much broader class of perversities than has previously been known. We also introduce a derived category version of the coherent intermediate extension functor.Under suitable hypotheses, we introduce a construction (called “S₂-extension”) in terms of perverse coherent sheaves of algebras on X that takes a finite morphism to U and extends it in a canonical way to a finite morphism to X. In particular, this construction gives a canonical “S₂-ification” of appropriate X. The construction also has applications to the “Macaulayfication” problem, and it is particularly well-behaved when X is Gorenstein.Our main goal, however, is to address a conjecture of Lusztig on the geometry of special pieces (certain subvarieties of the unipotent variety of a reductive algebraic group). The conjecture asserts in part that each special piece is the quotient of some variety (previously unknown for the exceptional groups and in positive characteristic) by the action of a certain finite group. We use S₂-extension to give a uniform construction of the desired variety.     

Linear Complexity,k-Error Linear Complexity,and the Discrete Fourier Transform

Complexity measures for sequences of elements of a finite field play an important role in cryptology. We focus first on the linear complexity of periodic sequences. By means of the discrete Fourier transform, we determine the number of periodic sequences S with given prime period length N and linear complexity L_N, 0(S)=c as well as the expected value of the linear complexity of N-periodic sequences. Cryptographically strong sequences should not only have a large linear complexity, but also the change of a few terms should not cause a significant decrease of the linear complexity. This requirement leads to the concept of the k-error linear complexity L_N, k(S) of sequences S with period length N. For some k and c we determine the number of periodic sequences S with given period length N and L_N, k(S)=c. For prime N we establish a lower bound on the expected value of the k-error linear complexity.     

On integral Cayley sum graphs

Let S be a subset of a finite abelian group G. The Cayley sum graph Cay⁺(G, S) of G with respect to S is a graph whose vertex set is G and two vertices g and h are joined by an edge if and only if g + h ∈ S. We call a finite abelian group G a Cayley sum integral group if for every subset S of G, Cay⁺(G, S) is integral i.e., all eigenvalues of its adjacency matrix are integers. In this paper, we prove that all Cayley sum integral groups are represented by Z₃ and Zn₂ ⁿ, n ≥ 1, where Z_k is the group of integers modulo k. Also, we classify simple connected cubic integral Cayley sum graphs.     

On supplementation and generalized projective modules

Discrete (quasi) modules form an important class in module theory, they are studied extensively by many authors. The decomposition theorem for quasidiscrete modules plays an important rule in the better understanding of such modules. In fact, every quasidiscrete module is a direct sum of hollow submodules. Here we introduce some new concepts (weak quasidiscrete, and S ₁- and S ₂-supplemented modules) which generalize the concept of quasidiscrete module. We show that some of the properties of quasidiscrete modules still hold in the class of weak quasidiscrete modules. We also obtain some properties of weak quasidiscrete modules, which are similar to the properties known for quasidiscrete modules. We introduce the concept of generalized relative projectivity (relative S-projectivemodules), and use it to characterize direct sums of hollowmodules. In fact, relative S-projectivity is an essential condition for direct sums of hollow modules to be weak quasidiscrete modules.     

Atomic subspaces of {L_1}-martingale spaces

In Part I of the present paper the following problem was investigated. Let G be a finite simple graph, and S be a finite set of primes. We say that G is representable with S if it is possible to attach rational numbers to the vertices of G such that the vertices v₁, v₂ are connected by an edge if and only if the difference of the attached values is an S-unit. In Part I we gave several results concerning the representability of graphs in the above sense.     

Representation and Approximation of Positivity Preservers

We consider a closed set S?? ⁿ and a linear operator

$\Phi \colon \mathbb{R}[X_1,\ldots,X_n]\rightarrow \mathbb{R}[X_1,\ldots,X_n]$

that preserves nonnegative polynomials, in the following sense: if f≥0 on S, then Φ(f)≥0 on S as well. We show that each such operator is given by integration with respect to a measure taking nonnegative functions as its values. This can be seen as a generalization of Haviland’s Theorem, which concerns linear functionals on ?[X ₁,…,X _n ]. For compact sets S we use the result to show that any nonnegativity preserving operator is a pointwise limit of very simple nonnegativity preservers with finite dimensional range.

     

The invertibility of the isoparametric mappings for triangular quadratic Lagrange finite elements

A reference triangular quadratic Lagrange finite element consists of a right triangle $\hat K$ with unit legs S ₁, S ₂, a local space $\hat L$ of quadratic polynomials on $\hat K$ and of parameters relating the values in the vertices and midpoints of sides of $\hat K$ to every function from $\hat L$ . Any isoparametric triangular quadratic Lagrange finite element is determined by an invertible isoparametric mapping ${F_h} = ({F_1},{F_2}) \in \hat L \times \hat L$ . We explicitly describe such invertible isoparametric mappings F _h for which the images F _h (S ₁), F _h (S ₂) of the segments S ₁, S ₂ are segments, too. In this way we extend the well-known result going back to W.B. Jordan, 1970, characterizing those invertible isoparametric mappings whose restrictions to the segments S ₁ and S ₂ are linear.     

Asymptotics of characters of symmetric groups, genus expansion and free probability

The convolution of indicators of two conjugacy classes on the symmetric group S_q is usually a complicated linear combination of indicators of many conjugacy classes. Similarly, a product of the moments of the Jucys-Murphy element involves many conjugacy classes with complicated coefficients. In this article, we consider a combinatorial setup which allows us to manipulate such products easily: to each conjugacy class we associate a two-dimensional surface and the asymptotic properties of the conjugacy class depend only on the genus of the resulting surface. This construction closely resembles the genus expansion from the random matrix theory. As the main application we study irreducible representations of symmetric groups S_q for large q. We find the asymptotic behavior of characters when the corresponding Young diagram rescaled by a factor q^-1/2 converge to a prescribed shape. The character formula (known as the Kerov polynomial) can be viewed as a power series, the terms of which correspond to two-dimensional surfaces with prescribed genus and we compute explicitly the first two terms, thus we prove a conjecture of Biane.     

ON THE STRUCTURE OF THE JACOBSON RADICAL OF GRADED RINGS

Abstract

We introduce a new large class of semigroups S including all locally finite, completely regular and strongly π-regular linear semigroups. For any semigroup S in the class and any S-graded ring R, the structure of the Jacobson radical of R is reduced to the radicals of subrings graded by the maximal subgroups of S. Many results on radicals follow from this reduction in a unified way. In two special cases the reduction is simplified.     

S/P images of upper triangular M-matrices

Preconditioning by approximate factorizations is widely used in iterative methods for solving linear systems such as those arising from the finite element formulation of many engineering problems. The influence of the ordering of the unknowns on their convergence behaviour has been the subject of recent investigations because of its particular relevance for the parallel implementation of these methods. Consistent orderings are attractive for parallel implementations and subclasses of these orderings have been shown to also enhance the convergence properties of the associated preconditioned iteration scheme. The present contribution is concerned with one such class of orderings, called S/P consistent orderings. More precisely, we review here their known properties and we propose a new definition which enlarges their scope of application. A device, called S/P image of an upper triangular M-matrix, provides a criterion for checking S/P consistency and a means to compute a relevant parameter, called maximal reduction ratio. All known properties of S/P consistent orderings are generalized to the new definition.     

Computability-theoretic and proof-theoretic aspects of partial and linear orderings

Szpilrajn’s Theorem states that any partial orderP=〈S,<p〉 has a linear extensionP=〈S,<L〉. This is a central result in the theory of partial orderings, allowing one to define, for instance, the dimension of a partial ordering. It is now natural to ask questions like “Does a well-partial ordering always have a well-ordered linear extension?” Variations of Szpilrajn’s Theorem state, for various (but not for all) linear order typesτ, that ifP does not contain a subchain of order typeτ, then we can chooseL so thatL also does not contain a subchain of order typeτ. In particular, a well-partial ordering always has a well-ordered extension.We show that several effective versions of variations of Szpilrajn’s Theorem fail, and use this to narrow down their proof-theoretic strength in the spirit of reverse mathematics.     

Principal Γ-cone for a tree

For any tree Γ, we introduce Γ-cones consisting of chambers and enumerate the number of chambers contained in two particular (called principal) Γ-cones. The problem is equivalent to the combinatorial problem of the enumeration of linear extensions of two bipartite orderings on a tree Γ. We characterize the principal Γ-cones among other Γ-cones by the strict maximality of the number of their chambers, and give a formula for this maximal (called principal) number by a finite sum of hook length formulae. We explain the formula through the simplicial block decomposition of principal Γ-cones. The results have their origin and application in the study of the topology related to Coxeter groups and Artin groups.     

Cyclic Hilbert Spaces and Connes’ Embedding Problem

Let M be a II ₁-factor with trace τ, the finite dimensional subspaces of L ²(M, τ) are not just common Hilbert spaces, but they have an additional structure. We introduce the notion of a cyclic linear space by taking these additional properties as axioms. In Sect. 3 we formulate the following problem: “does every cyclic Hilbert space embed into L ²(M, τ), for some M?”. An affirmative answer would imply the existence of an algorithm to check Connes’ embedding Conjecture. In Sect. 4 we make a first step towards the answer of the previous question.     

Finite derivation type for semilattices of semigroups

In this paper we investigate how the combinatorial property finite derivation type (FDT) is preserved in a semilattice of semigroups. We prove that if $S= \mathcal{S}[Y,S_{\alpha}]$ is a semilattice of semigroups such that Y is finite and each S _?? (????Y) has FDT, then S has FDT. As a consequence we can show that a strong semilattice of semigroups $\mathcal{S}[Y,S_{\alpha},\lambda_{\alpha,\beta}]$ has FDT if and only if Y is finite and every semigroup S _?? (????Y) has FDT.     

Schwarzian derivative, integral means, and the affine and linear invariant families of biharmonic mappings

In this paper we discuss the properties of the Schwarzian derivative, integral means and the affine and linear invariant families of biharmonic mappings. First, we introduce the Schwarzian derivative S(F) for biharmonic mappings F = ∣z∣²G + H, and obtain several necessary and sufficient conditions for S(F) to be analytic. Second, we introduce the subordination of biharmonic mappings and obtain inequalities for integral means of subordinate biharmonic mappings. Finally, we introduce the affine and linear invariant families of biharmonic mappings and prove several estimates related to the Jacobian of functions in these invariant families.     

Countable linear orders with disjoint infinite intervals are mutually orthogonal

Two linear orderings of a same set are perpendicular if the only self-mappings of this set that preserve them both are the identity and the constant mappings. Two linear orderings are orthogonal if they are isomorphic to two perpendicular linear orderings. We show that two countable linear orderings are orthogonal as soon as each one has two disjoint infinite intervals. From this and previously known results it follows in particular that each countably infinite linear ordering is orthogonal to itself.