Filters








463 Hits in 2.6 sec

Near-homogeneous tournaments and permutation groups

Annie Astié-Vidal, Vincent Dugat
1992 Discrete Mathematics  
AstiC-Vidal, A. and V. Dugat, Near-homogeneous tournaments and permutation groups, Discrete Mathematics 102 (1992) 111-120. tournois sommet-symetriques qui ont un nombre minimal d'orbites d'arcs.  ...  There is exactly one such tournament for each order. (2) The wreath products of two quadratic residue tournaments. Near-homogeneous tournaments and permutation groups Proof.  ...  Near-homogeneous tournaments In [ 1, T, is near-homogeneous iff it is regular and O(x) [or Z(x)] is near-regular for each vertex x.  ... 
doi:10.1016/0012-365x(92)90046-i fatcat:43hljo53lncjvo6r3ws7thjrdi

Page 2386 of Mathematical Reviews Vol. , Issue 93e [page]

1993 Mathematical Reviews  
Janse van Rensburg (North York) 93e:05037 05C20 05B30 05C25 Astié-Vidal, Annie (F-TOUL3-ML); Dugat, Vincent (F-TOUL3-ML) Near-homogeneous tournaments and permutation groups.  ...  three near-homogeneous tournaments of orders 5,9, and 13.  ... 

Page 1693 of Mathematical Reviews Vol. 55, Issue 6 [page]

1978 Mathematical Reviews  
Random walks on doubly transitive tournaments are studied and shown to have easily calculatable transition probabilities.  ...  Whether the symmetric group or alternating group is generated depends on the parity of the simple cut and the generalized faro shuffle as group operations.” 12533 Frankl, Peter; Deza, Mikhail 12534 On  ... 

Page 5279 of Mathematical Reviews Vol. , Issue 2001H [page]

2001 Mathematical Reviews  
For homogeneous objects one can determine whether the au- tomorphism group is primitive, and in almost all cases it is.  ...  A permutation group on a set X is said to be primitive if it leaves invariant no equivalence relation except the trivial ones, equality and the universal relation ¥ x X.  ... 

General frame constructions for Z-cyclic triplewhist tournaments

Gennian Ge
2007 Journal of combinatorial theory. Series A  
Frames are useful in dealing with resolvable designs such as resolvable balanced incomplete block designs and triplewhist tournaments.  ...  . , h n ; u)-regular Z-cyclic triplewhist tournament frame is defined, and used to establish several quite general recursive constructions for Z-cyclic triplewhist tournaments.  ...  This representative (near) resolution class is typically called the initial round of the tournament, and conventionally, in the near resolvable case, misses player 0.  ... 
doi:10.1016/j.jcta.2006.08.011 fatcat:pf5jak7np5cx7m34qifh6cgjqm

Rock, Paper, Scissors, Etc – Topics in the Theory of Regular Tournaments [article]

Ethan Akin
2020 arXiv   pre-print
These include games on groups of odd order and the associated games on coset spaces. We obtain a new lower bound for the number of games of size 2n+1.  ...  The extended games are regular tournaments where each strategy beats and is beaten by exactly half of the alternatives. We survey the properties of regular tournaments, which we will call games.  ...  The trivial tournament on a singleton and the 3-cycle are the only finite homogeneous tournaments.  ... 
arXiv:1806.11241v4 fatcat:d2clurt3fnh45l2kihieoas7re

Genetic algorithm theory

Jonathan E. Rowe
2008 Proceedings of the 2008 GECCO conference companion on Genetic and evolutionary computation - GECCO '08  
We find there is one fixed-point in Λ, around the optimum, and another just outside, but near the false optimum.  ...  Choose some subset C ⊆ {1, 2, . . . , m} and consider permutations that have the property that π(i) = i for all i ∈ C . These permutations form a subgroup.  ...  Automorphisms We now consider all permutations of Ω which preserve the graph structure. That is, π : Ω → Ω is such a permutation if whenever i and j are neighbours, so are π(i) and π(j).  ... 
doi:10.1145/1388969.1389067 dblp:conf/gecco/Rowe08 fatcat:l7kolsvjdvaztl5wlgv2qgnlqu

Genetic algorithm theory

Jonathan E. Rowe
2012 Proceedings of the fourteenth international conference on Genetic and evolutionary computation conference companion - GECCO Companion '12  
We find there is one fixed-point in Λ, around the optimum, and another just outside, but near the false optimum.  ...  It is sometimes said that tournament selection is stronger than proportional selection, as it moves more quickly towards a homogeneous population.  ...  That is, π : Ω → Ω is such a permutation if whenever i and j are neighbours, so are π(i) and π(j). This set of permutations forms a group action on Ω called the automorphism group. Jonathan E.  ... 
doi:10.1145/2330784.2330923 dblp:conf/gecco/Rowe12 fatcat:x73wrzi2crbpdlslv7aiiwia5u

Genetic algorithm theory

Jonathan E. Rowe
2007 Proceedings of the 2007 GECCO conference companion on Genetic and evolutionary computation - GECCO '07  
We find there is one fixed-point in Λ, around the optimum, and another just outside, but near the false optimum.  ...  It is sometimes said that tournament selection is stronger than proportional selection, as it moves more quickly towards a homogeneous population.  ...  That is, π : Ω → Ω is such a permutation if whenever i and j are neighbours, so are π(i) and π(j). This set of permutations forms a group action on Ω called the automorphism group. Jonathan E.  ... 
doi:10.1145/1274000.1274125 dblp:conf/gecco/Rowe07 fatcat:xyhgmsrvzrdgpkzyb65k6jz2am

Genetic algorithm theory

Jonathan E. Rowe
2011 Proceedings of the 13th annual conference companion on Genetic and evolutionary computation - GECCO '11  
We find there is one fixed-point in Λ, around the optimum, and another just outside, but near the false optimum.  ...  It is sometimes said that tournament selection is stronger than proportional selection, as it moves more quickly towards a homogeneous population.  ...  That is, π : Ω → Ω is such a permutation if whenever i and j are neighbours, so are π(i) and π(j). This set of permutations forms a group action on Ω called the automorphism group. Jonathan E.  ... 
doi:10.1145/2001858.2002126 dblp:conf/gecco/Rowe11 fatcat:3xdar2hzrrf7pnczd5rlvkl47u

Preference Diversity Orderings

Alexander Karpov
2017 Group Decision and Negotiation  
Two new indices (geometric mean based and leximaxbased) are developed that satisfy a new criterion. Leximax-based orders act as a polarization index and are compared with Can et al.'  ...  Applying preference diversity axiomatics, a generalization of the Alcalde-Unzu and Vorsatz (2016) criterion, is developed. It is shown that all previously used indices violate this criterion.  ...  Weighted tournament-based PDI Preference profiles , , , have the same weighted tournament; hence the weighted tournament-based PDI do not satisfy reverse invariant discernibility and cannot represent the  ... 
doi:10.1007/s10726-017-9532-z fatcat:aaurx5u5lnaeniatbmxsrgfndy

Smooth approximations and CSPs over finitely bounded homogeneous structures [article]

Antoine Mottet, Michael Pinsker
2021 arXiv   pre-print
We develop the novel machinery of smooth approximations, and apply it to confirm the CSP dichotomy conjecture for first-order reducts of the random tournament, various homogeneous graphs including the  ...  random graph, and for expansions of the order of the rationals.  ...  Permutation groups with the latter property are called oligomorphic.  ... 
arXiv:2011.03978v5 fatcat:wt46ufzc7bhvfirnwdx3kejmva

Page 1532 of Mathematical Reviews Vol. 46, Issue 6 [page]

1973 Mathematical Reviews  
Difference sets have been extensively studied in groups; here the concept of difference set is defined and studied in loops.  ...  Mood, Amer. hath Monthly 62 (1955), 714-716; MR 17, 449] to allow for near approximations to those cases known to be impossible: a balanced Howell movement consists of three finite sets X, Y and R with  ... 

Strategies of Teams in Soccerbots

R. Geetha Ramani, R. Subramanian, M. Sindurathy
2008 International Journal of Advanced Robotic Systems  
TeamBots was designed and developed by Tucker Balch at Carnegie Mellon University, as development and testing environment for studying collaborative robot behaviour.  ...  The teams selected were: Now again, the top 4 teams of Group B were selected and tournament was conducted as shown in theFig. 6: The teams were: Fig. 2.  ...  Get setup for iterating through the permutation array. Only kick if behind the Ball.  ... 
doi:10.5772/6229 fatcat:yfihozdm6fdkboay5ycjxtqfby

Forbidden substructures and combinatorial dichotomies: WQO and universality

Gregory Cherlin
2011 Discrete Mathematics  
We discuss twelve open problems of varying levels of concreteness, and we point to the "Hairy Ball Problem" as a particularly concrete problem, which we give first in direct model theoretic terms, and  ...  from a logical perspective, and Vince Vatter for suggesting connections with permutations via Cameron's point of view in [5] .  ...  Debts to work by or with Latka, Shelah, Shi, and Tallgren are visible throughout the paper.  ... 
doi:10.1016/j.disc.2011.03.014 fatcat:blhlz7c5cneuvhzhsugk464udi
« Previous Showing results 1 — 15 out of 463 results