On the number of graphs with a given endomorphism monoid

For a given finite monoid , let be the number of graphs on n vertices with endomorphism monoid isomorphic to . For any nontrivial monoid we prove that where and are constants depending only on with .For every k there exists a monoid of size k with , on the other hand if a group of unity of has a size k>2 then .     

On the computation of the jdeg of blowup algebras

For a graded algebra , its is a global degree that can be used to study issues of complexity of the normalization . Here some techniques grounded on Rees algebra theory are used to estimate . A closely related notion, of divisorial generation, is introduced to count numbers of generators of .     

Classical predicative logic-enriched type theories

A logic-enriched type theory (LTT) is a type theory extended with a primitive mechanism for forming and proving propositions. We construct two LTTs, named and , which we claim correspond closely to the classical predicative systems of second order arithmetic and . We justify this claim by translating each second order system into the corresponding LTT, and proving that these translations are conservative. This is part of an ongoing research project to investigate how LTTs may be used to formalise different approaches to the foundations of mathematics.The two LTTs we construct are subsystems of the logic-enriched type theory , which is intended to formalise the classical predicative foundation presented by Herman Weyl in his monograph Das Kontinuum. The system has also been claimed to correspond to Weyl’s foundation. By casting and as LTTs, we are able to compare them with . It is a consequence of the work in this paper that is strictly stronger than .The conservativity proof makes use of a novel technique for proving one LTT conservative over another, involving defining an interpretation of the stronger system out of the expressions of the weaker. This technique should be applicable in a wide variety of different cases outside the present work.     

Basic sets in defining characteristic for general linear groups of small rank

Let q be a power of some prime number p. Let be a connected reductive group defined over the field with q elements and let F be the corresponding Frobenius map. In this note, we give methods to find relations between the restrictions on semisimple elements of the irreducible characters of . As illustration, we explicitly determine a p-basic set for , and .     

Quadratic prediction problems in multivariate linear models

Linear and quadratic prediction problems in finite populations have become of great interest to many authors recently. In the present paper, we mainly aim to extend the problem of quadratic prediction from a general linear model, of form , to a multivariate linear model, denoted by with . Firstly, the optimal invariant quadratic unbiased (OIQU) predictor and the optimal invariant quadratic (potentially) biased (OIQB) predictor of for any particular symmetric nonnegative definite matrix satisfying are derived. Secondly, we consider predicting and . The corresponding restricted OIQU predictor and restricted OIQB predictor for them are given. In addition, we also offer four concluding remarks. One concerns the generalization of predicting and , and the others are concerned with three possible extensions from multivariate linear models to growth curve models, to restricted multivariate linear models, and to matrix elliptical linear models.     

On a relation between certain cohomological invariants

Let G be a group, the supremum of the projective lengths of the injective ZG-modules and the supremum of the injective lengths of the projective ZG-modules. The invariants and were studied in [T.V. Gedrich, K.W. Gruenberg, Complete cohomological functors on groups, Topology Appl. 25 (1987) 203-223] in connection with the existence of complete cohomological functors. If is finite then [T.V. Gedrich, K.W. Gruenberg, Complete cohomological functors on groups, Topology Appl. 25 (1987) 203-223] and , where is the generalized cohomological dimension of G [B.M. Ikenaga, Homological dimension and Farrell cohomology, J. Algebra 87 (1984) 422-457]. Note that if G is of finite virtual cohomological dimension. It has been conjectured in [O. Talelli, On groups of type Φ, Arch. Math. 89 (1) (2007) 24-32] that if is finite then G admits a finite dimensional model for , the classifying space for proper actions.We conjecture that for any group G and we prove the conjecture for duality groups, fundamental groups of graphs of finite groups and fundamental groups of certain finite graphs of groups of type .     

On the Wiener integral with respect to a sub-fractional Brownian motion on an interval

The domain of the Wiener integral with respect to a sub-fractional Brownian motion , , k≠0, is characterized. The set is a Hilbert space which contains the class of elementary functions as a dense subset. If , any element of is a function and if , the domain is a space of distributions.     

Higher Kurtz randomness

A real x is -Kurtz random (-Kurtz random) if it is in no closed null set ( set). We show that there is a cone of -Kurtz random hyperdegrees. We characterize lowness for -Kurtz randomness as being -dominated and -semi-traceable.     

On the relation between cluster and classical tilting

Let be a triangulated category with a cluster tilting subcategory U. The quotient category is abelian; suppose that it has finite global dimension.We show that projection from to sends cluster tilting subcategories of to support tilting subcategories of , and that, in turn, support tilting subcategories of can be lifted uniquely to weak cluster tilting subcategories of .     

On spaces which are D, linearly D and transitively D

In this note, we comment on D-spaces, linearly D-spaces and transitively D-spaces. We show that every meta-Lindelöf space is transitively D. If X is a weak -refinable TD-scattered space, then X is transitively D, where TD is the class of all transitively D-spaces. If X is a weak -refinable -scattered space, then X is a D-space, where is the class of all D-spaces, and hence every weak -refinable (or submetacompact) scattered space is a D-space. This gives a positive answer to a question mentioned by Martínez and Soukup. In the last part of this note, we show that if X is a weak -refinable space then X is linearly D.     

Kirillov-Reshetikhin crystals for nonexceptional types

We provide combinatorial models for all Kirillov-Reshetikhin crystals of nonexceptional type, which were recently shown to exist. For types , , we rely on a previous construction using the Dynkin diagram automorphism which interchanges nodes 0 and 1. For type we use a Dynkin diagram folding and for types , a similarity construction. We also show that for types and the analog of the Dynkin diagram automorphism exists on the level of crystals.     

Periodicity of Adams operations on the Green ring of a finite group

The Adams operations and on the Green ring of a group G over a field K arise from the study of the exterior powers and symmetric powers of KG-modules. When G is finite and K has prime characteristic p we show that and are periodic in n if and only if the Sylow p-subgroups of G are cyclic. In the case where G is a cyclic p-group we find the minimum periods and use recent work of Symonds to express in terms of .     

All countable monoids embed into the monoid of the infinite random graph

We prove that the full transformation monoid on a countably infinite set is isomorphic to a submonoid of , the endomorphism monoid of the infinite random graph R. Consequently, embeds each countable monoid, satisfies no nontrivial monoid identity, and has an undecidable universal theory.     

Subgroup distortion in wreath products of cyclic groups

We study the effects of subgroup distortion in the wreath products , where A is finitely generated abelian. We show that every finitely generated subgroup of has distortion function equivalent to some polynomial. Moreover, for A infinite, and for any polynomial l^k, there is a 2-generated subgroup of having distortion function equivalent to the given polynomial. Also, a formula for the length of elements in arbitrary wreath product easily shows that the group has distorted subgroups, while the lamplighter group has no distorted (finitely generated) subgroups. In the course of the proof, we introduce a notion of distortion for polynomials. We are able to compute the distortion of any polynomial in one variable over Z,R or C.     

Cut elimination and strong separation for substructural logics: An algebraic approach

We develop a general algebraic and proof-theoretic study of substructural logics that may lack associativity, along with other structural rules. Our study extends existing work on (associative) substructural logics over the full Lambek Calculus (see, for example, Ono (2003) [34], Galatos and Ono (2006) [18], Galatos et al. (2007) [17]). We present a Gentzen-style sequent system that lacks the structural rules of contraction, weakening, exchange and associativity, and can be considered a non-associative formulation of . Moreover, we introduce an equivalent Hilbert-style system and show that the logic associated with and is algebraizable, with the variety of residuated lattice-ordered groupoids with unit serving as its equivalent algebraic semantics.Overcoming technical complications arising from the lack of associativity, we introduce a generalized version of a logical matrix and apply the method of quasicompletions to obtain an algebra and a quasiembedding from the matrix to the algebra. By applying the general result to specific cases, we obtain important logical and algebraic properties, including the cut elimination of and various extensions, the strong separation of , and the finite generation of the variety of residuated lattice-ordered groupoids with unit.     

On wreathed lexicographic products of graphs

This paper proves a necessary and sufficient condition for the endomorphism monoid of a lexicographic product G[H] of graphs G,H to be the wreath product of the monoids and . The paper also gives respective necessary and sufficient conditions for specialized cases such as for unretractive or triangle-free graphs G.