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 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.     

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 .     

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.     

New applications of Besov-type and Triebel-Lizorkin-type spaces

In this paper, the authors prove that Besov-Morrey spaces are proper subspaces of Besov-type spaces and that Triebel-Lizorkin-Morrey spaces are special cases of Triebel-Lizorkin-type spaces . The authors also establish an equivalent characterization of when τ∈[0,1/p). These Besov-type spaces and Triebel-Lizorkin-type spaces were recently introduced to connect Besov spaces and Triebel-Lizorkin spaces with Q spaces. Moreover, for the spaces and , the authors investigate their trace properties and the boundedness of the pseudo-differential operators with homogeneous symbols in these spaces, which generalize the corresponding classical results of Jawerth and Grafakos-Torres by taking τ=0.     

Exact rates in log law for positively associated random variables

Let be a strictly stationary sequence of positively associated random variables with mean zero and finite variance. Set , Mn=maxk?n|Sk|, n?1. Suppose . In this paper, we study the exact convergence rates of a kind of weighted infinite series of , and as ε↘0, respectively.     

How to play the Majority game with a liar

The Majority game is played by a questioner () and an answerer (). holds n elements, each of which can be labeled as 0 or 1. is trying to identify some element holds as having the Majority label or, in the case of a tie, claim there is none. To do this asks questions comparing whether two elements have the same or different label. ’s goal is to ask as few questions as possible while ’s goal is to delay as much as possible. Let q^∗ denote the minimal number of questions needed for to identify a Majority element regardless of ’s answers.In this paper we investigate upper and lower bounds for q^∗ in a variation of the Majority game, where is allowed to lie up to t times. We consider two versions of the game, the adaptive (where questions are asked sequentially) and the oblivious (where questions are asked in one batch).     

Polar syzygies in characteristic zero: The monomial case

Given a set of forms , where k is a field of characteristic zero, we focus on the first syzygy module Z of the transposed Jacobian module , whose elements are called differential syzygies of . There is a distinct submodule P⊂Z coming from the polynomial relations of through its transposed Jacobian matrix, the elements of which are called polar syzygies of . We say that is polarizable if equality P=Z holds. This paper is concerned with the situation where are monomials of degree 2, in which case one can naturally associate to them a graph with loops and translate the problem into a combinatorial one. The main result is a complete combinatorial characterization of polarizability in terms of special configurations in this graph. As a consequence, we show that polarizability implies normality of the subalgebra and that the converse holds provided the graph is free of certain degenerate configurations. One main combinatorial class of polarizability is the class of polymatroidal sets. We also prove that if the edge graph of has diameter at most 2 then is polarizable. We establish a curious connection with birationality of rational maps defined by monomial quadrics.     

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 .     

Finite-sample inference with monotone incomplete multivariate normal data, II

We continue our recent work on inference with two-step, monotone incomplete data from a multivariate normal population with mean and covariance matrix . Under the assumption that is block-diagonal when partitioned according to the two-step pattern, we derive the distributions of the diagonal blocks of and of the estimated regression matrix, . We represent in terms of independent matrices; derive its exact distribution, thereby generalizing the Wishart distribution to the setting of monotone incomplete data; and obtain saddlepoint approximations for the distributions of and its partial Iwasawa coordinates. We prove the unbiasedness of a modified likelihood ratio criterion for testing , where is a given matrix, and obtain the null and non-null distributions of the test statistic. In testing , where and are given, we prove that the likelihood ratio criterion is unbiased and obtain its null and non-null distributions. For the sphericity test, , we obtain the null distribution of the likelihood ratio criterion. In testing we show that a modified locally most powerful invariant statistic has the same distribution as a Bartlett-Pillai-Nanda trace statistic in multivariate analysis of variance.     

Homology of artinian and Matlis reflexive modules, I

Let R be a commutative local noetherian ring, and let L and L^′ be R-modules. We investigate the properties of the functors and . For instance, we show the following:

(a)

if L and L^′ are artinian, then is artinian, and is noetherian over the completion ;

(b)

if L is artinian and L^′ is Matlis reflexive, then , , and are Matlis reflexive.

Also, we study the vanishing behavior of these functors, and we include computations demonstrating the sharpness of our results.     

Well-posedness for the Navier-Stokes-Nernst-Planck-Poisson system in Triebel-Lizorkin space and Besov space with negative indices

This paper is concerned with the well-posedness of the Navier-Stokes-Nerst-Planck-Poisson system (NSNPP). Let sp=−2+n/p. We prove that the NSNPP has a unique local solution for in a subspace, i.e., Vu1×Vv1×Vv1, of with . We also prove that there exists a unique small global solution for any small initial data with .     

A non-implication between fragments of Martin’s Axiom related to a property which comes from Aronszajn trees

We introduce a property of forcing notions, called the anti-, which comes from Aronszajn trees. This property canonically defines a new chain condition stronger than the countable chain condition, which is called the property .In this paper, we investigate the property . For example, we show that a forcing notion with the property does not add random reals. We prove that it is consistent that every forcing notion with the property has precaliber ℵ₁ and for forcing notions with the property fails. This negatively answers a part of one of the classical problems about implications between fragments of .     

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.     

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.     

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 .     

Mixed Artin-Tate motives over number rings

This paper studies Artin-Tate motives over bases , for a number field F. As a subcategory of motives over S, the triangulated category of Artin-Tate motives is generated by motives , where ? is any finite map. After establishing the stability of these subcategories under pullback and pushforward along open and closed immersions, a motivic t-structure is constructed. Exactness properties of these functors familiar from perverse sheaves are shown to hold in this context. The cohomological dimension of mixed Artin-Tate motives () is two, and there is an equivalence .     

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.     

On conjugacy classes in metaplectic groups

Let E be a finite dimensional symplectic space over a local field of characteristic zero. We show that for every element in the metaplectic double cover of the symplectic group Sp(E), and are conjugate by an element of GSp(E) with similitude −1.