Results 11 to 20 of about 196,827 (283)
Descent sets for oscillating tableaux [PDF]
Discrete Mathematics & Theoretical Computer Science, 2013 The descent set of an oscillating (or up-down) tableau is introduced. This descent set plays the same role in the representation theory of the symplectic groups as the descent set of a standard tableau plays in the representation theory of the general ...
Martin Rubey +2 more
doaj +1 more source
An update on combinatorial method for aggregation of expert judgments in AHP
Production, 2021 Paper aims the paper aims to demonstrate the advantages of several modifications of combinatorial method of expert judgment aggregation in AHP. Modifications are based on 1) weighting of spanning trees; 2) sorting of spanning trees by graph diameter ...
Sergii Kadenko +3 more
doaj +1 more source
Fixed Points of Maps of a Nonaspherical Wedge
Fixed Point Theory and Applications, 2009 Let X be a finite polyhedron that has the homotopy type of the wedge of the projective plane and the circle. With the aid of techniques from combinatorial group theory, we obtain formulas for the Nielsen numbers of the selfmaps of X.
Seung Won Kim +4 more
doaj +2 more sources
Combinatorics of symplectic invariant tensors [PDF]
Discrete Mathematics & Theoretical Computer Science, 2015 An important problem from invariant theory is to describe the subspace of a tensor power of a representation invariant under the action of the group. According to Weyl's classic, the first main (later: 'fundamental') theorem of invariant theory states ...
Martin Rubey, Bruce W. Westbury
doaj +1 more source
Marked fatgraph complexes and surface automorphisms [PDF]
, 2012 Combinatorial aspects of the Torelli-Johnson-Morita theory of surface automorphisms are extended to certain subgroups of the mapping class groups. These subgroups are defined relative to a specified homomorphism from the fundamental group of the surface ...
Kuno, Yusuke +2 more
core +2 more sources
Long Cycle Factorizations: Bijective Computation in the General Case [PDF]
Discrete Mathematics & Theoretical Computer Science, 2013 This paper is devoted to the computation of the number of ordered factorizations of a long cycle in the symmetric group where the number of factors is arbitrary and the cycle structure of the factors is given. Jackson (1988) derived the first closed form
Ekaterina A. Vassilieva
doaj +1 more source
Combinatorial conditionality of culture-specific collocations [PDF]
SHS Web of Conferences, 2019 Combinatorial lexicology as a section of lexicology deals with the theory of syntagms, valency, collocability, the relation of word semantics and collocability, the relation of syntagmatics of a language sign and the language system, functions of ...
Arkhipova Elena, Vlavatskaya Marina
doaj +1 more source
On the simplicity crossed polymodules
Journal of New Results in Science, 2023 The conception of crossed modules was first expressed by Whitehead when he was working on combinatorial theory. This concept has many uses in various fields, such as category theory, algebra, and k-theory. Moreover, one of the equations that plays a very
Mohammad Ali Dehghanizadeh
doaj +1 more source
On the existence of block-transitive combinatorial designs [PDF]
, 2010 Block-transitive Steiner $t$-designs form a central part of the study of highly symmetric combinatorial configurations at the interface of several disciplines, including group theory, geometry, combinatorics, coding and information theory, and ...
Huber, Michael
core +4 more sources
The chiral ring of a symmetric orbifold and its large N limit
Journal of High Energy Physics, 2023 We analyze the chiral operator ring of the symmetric orbifold conformal field theory on the complex two-plane ℂ2. We compute the large N limit of the ring and exhibit its factorized leading order behaviour.
Sujay K. Ashok, Jan Troost
doaj +1 more source