Let G be the group of rational points of a connected reductive p-adic group and let K be a maximal compact subgroup satisfying conditions of Theorem 5 from Harish-Chandra (1970). Generalized spherical functions on G are eigenfunctions for the action of the Bernstein center, which satisfy a transformation property for the action of K. In this paper we show that spaces of generalized spherical fu...

We consider the class of graphs for which the edge connectivity is equal to the maximum number of edge-disjoint spanning trees, and the natural generalization to matroids, where the cogirth is equal to the number of disjoint bases. We provide descriptions of such graphs and matroids, showing that such a graph (or matroid) has a unique decomposition. In the case of graphs, our results are releva...

A computational verb set (verb set for short) consists of a computational verb and a crisp set or a fuzzy set. Verb sets generalize the other sets from linguistic structure “BE+statement” to “verb+statement”. Verb sets are strongly connected to computational verbs and their contexts. In this paper, the framework of verb sets and some basic concepts and properties of verb sets are given. An appl...

Let mod kG be the stable category of finitely generated modular representations of a finite group G over a field k. We prove a Krull-Remak-Schmidt theorem for thick subcategories of mod kG. It is shown that every thick tensor-ideal C of mod kG (i.e. a thick subcategory which is a tensor ideal) has a (usually infinite) unique decomposition C = ∐ i∈I Ci into indecomposable thick tensor-ideals. Th...

We determine the set of connected components of minuscule affine Deligne-Lusztig varieties for special maximal compact subgroups of unramified connected reductive groups. Partial results are also obtained for non-minuscule closed affine Deligne-Lusztig varieties. We consider both the function field case and its analog in mixed characteristic. In particular, we determine the set of connected com...

This paper deals with the complexity issues of some new interesting spanning tree problems. Here we define some new spanning tree problems by imposing various constraints and restrictions on graph parameters and present relevant results. Also we introduce a new notion of “set version” of some decision problems having integer K < |V | as a parameter in the input instance, where we replace K by a...