Zobrazeno 1 - 10
of 950
pro vyhledávání: '"Bijection, injection and surjection"'
Publikováno v:
Theoretical Computer Science. 896:79-97
In this paper we consider doubly symmetric Dyck words, i.e. Dyck words which are fixed by two symmetry operations α and β introduced in [1] . We study combinatorial properties of doubly symmetric Dyck words, leading to the definition of two recursi
Autor:
Eugenio Giannelli
Publikováno v:
Algebra & Number Theory. 15:1809-1835
We study fields of values of the restriction to Sylow subgroups of irreducible characters of the normalizers of Sylow subgroups in symmetric and alternating groups. As an application, we show that these classes of groups admit a McKay bijection that
Autor:
Sergi Elizalde
Publikováno v:
Annals of Combinatorics. 25:877-911
The degree of symmetry of a combinatorial object, such as a lattice path, is a measure of how symmetric the object is. It typically ranges from zero, if the object is completely asymmetric, to its size, if it is completely symmetric. We study the beh
Autor:
François Renaud
Publikováno v:
Applied Categorical Structures. 30:81-122
This article is the second part of a series of three articles, in which we develop a higher covering theory of racks and quandles. This project is rooted in M. Eisermann’s work on quandle coverings, and the categorical perspective brought to the su
Publikováno v:
Communications in Mathematical Physics. 384:909-954
We define and study the totally nonnegative part of the Chow quotient of the Grassmannian, or more simply the nonnegative configuration space. This space has a natural stratification by positive Chow cells, and we show that nonnegative configuration
Publikováno v:
Repositório Institucional da USP (Biblioteca Digital da Produção Intelectual)
Universidade de São Paulo (USP)
instacron:USP
Math. Proc. Cambridge Philos. Soc.
Math. Proc. Cambridge Philos. Soc., In press
Universidade de São Paulo (USP)
instacron:USP
Math. Proc. Cambridge Philos. Soc.
Math. Proc. Cambridge Philos. Soc., In press
Generalising previous results on classical braid groups by Artin and Lin, we determine the values of m, n ∈ $\mathbb N$ for which there exists a surjection between the n- and m-string braid groups of an orientable surface without boundary. This res
Autor:
Victor L. Selivanov
Publikováno v:
Sibirskie Elektronnye Matematicheskie Izvestiya. 18:121-135
We define and study an effective version of the Wadge hierarchy in computable quasi-Polish spaces which include most spaces of interest for computable analysis. Along with hierarchies of sets we study hierarchies of k-partitions which are interesting
Publikováno v:
Journal of Computer and System Sciences. 115:54-63
Let M = ( T , C , P ) be a security model, where T is a rooted tree, C is a multiset of costs and P is a multiset of prizes and let ( T , c , p ) be a security system, where c and p are bijections of costs and prizes. The problems of computing an opt
Autor:
Bin Han
Publikováno v:
Electronic Research Archive. 29:1925-1944
Flajolet and Francon [European. J. Combin. 10 (1989) 235-241] gave a combinatorial interpretation for the Taylor coefficients of the Jacobian elliptic functions in terms of doubled permutations. We show that a multivariable counting of the doubled pe
Autor:
A. S. Morozov, Peter Koepke
Publikováno v:
Algebra and Logic. 59:423-436
We examine whether some well-known properties of partial recursive functions are valid for ITBM-computable functions, i.e., functions which can be computed with infinite time Blum–Shub–Smale machines. It is shown that properties of graphs of ITBM