Related papers: Space functions of groups
We classify the subsets of a group by their sizes, formalize the basic methods of partitions and apply them to partition a group to subsets of prescribed sizes.
An equivalence relation in the symmetric group, where is a positive integer has been considered. An algorithm for calculation of the number of the equivalence classes by this relation for arbitrary integer has been described.
This paper presents a number of problems about mapping class groups and moduli space. The paper will appear in the book "Problems on Mapping Class Groups and Related Topics", ed. by B. Farb, Proc. Symp. Pure Math. series, Amer. Math. Soc.
In this paper we examine various properties/constructions which are known for reductive groups and we do some experiments to see to what extent they generalize to symmetric spaces.
In this work we carry out a complete group classification of Burgers' equations.
The relation between representations and positive definite functions is a key concept in harmonic analysis on topological groups. Recently this relation has been studied on topological groupoids. This is the second in a series of papers in…
We obtain sampling and interpolation theorems in radial weighted spaces of analytic functions for weights of arbitrary (more rapid than polynomial) growth. We give an application to invariant subspaces of arbitrary index in large weighted…
We give solutions to some extremal problems involving distance function in mixed norm spaces of harmonic functions on the unit ball of R^n
We prove a compactness result with respect to $\Gamma$-convergence for a class of integral functionals which are expressed as a sum of a local and a non-local term. The main feature is that, under our hypotheses, the local part of the…
Complexity theory can be viewed as the study of the relationship between computation and applications, understood the former as complexity classes and the latter as problems. Completeness results are clearly central to that view. Many…
In this paper, new classes of functions are defined. These spaces generalize Morrey spaces and give a refinement of Lebesgue spaces. Some embeddings between these new classes are also proved. Finally, the authors apply these classes of…
We construct a map from fundamental groups of complements to some plane configurations to the groups $G_{n}^{k}$ for large $k$. We discuss connection between the groups $G_{n}^{k}$ for different $G_{n}^{k}$ and their geometric realization.
In this paper we consider several constrained activity scheduling problems in the time and space domains, like finding activity orderings which optimize the values of several objective functions (time scheduling) or finding optimal…
We present the notion of injective hom-complexity, leading to a connection between the covering number of a group and the sectional number of a group homomorphism, and provide estimates for computing this invariant.
Extending pioneering work by Weinberg, Conrad, McCleary, and others, we provide a systematic way of relating spaces of right orders on a partially ordered group, on the one hand, and spectral spaces of free lattice-ordered groups, on the…
In the context of Higman embeddings of recursive groups into finitely presented groups we suggest an algorithm which uses Higman operations to explicitly constructs the specific recursively enumerable sets of integer sequences arising…
Organisations rely upon group formation to solve complex tasks, and groups often adapt to the demands of the task they face by changing their composition periodically. Previous research comes to ambiguous results regarding the effects of…
We study the weighted Fock spaces in one and several complex variables. We evaluate the dimension of these spaces in terms of the weight function extending and completing earlier results by Rozenblum-Shirokov and Shigekawa.
In this paper, we study the word problem for automaton semigroups and automaton groups from a complexity point of view. As an intermediate concept between automaton semigroups and automaton groups, we introduce automaton-inverse semigroups,…
A method of random search based on Kolmogorov complexity is proposed and applied to two search problems in group theory. The method is provably effective but not practical, so the applications involve heuristic approximations. Perhaps…