اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدGreedy Galois Games
40
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We show that two duelers with similar, lousy shooting skills (a.k.a. Galois duelers) will choose to take turns firing in accordance with the famous Thue-Morse sequence if they greedily demand their chances to fire as soon as the others a priori probability of winning exceeds their own. This contrasts with a result from the approximation theory of complex functions that says what more patient duelers would do, if they really cared about being as fair as possible. We note a consequent interpretation of the Thue-Morse sequence in terms of certain expansions in fractional bases close to, but greater than, 1.
قيم البحث
اقرأ أيضاً
Following a given ordering of the edges of a graph $G$, the greedy edge colouring procedure assigns to each edge the smallest available colour. The minimum number of colours thus involved is the chromatic index $chi(G)$, and the maximum is the so-cal
led Grundy chromatic index. Here, we are interested in the restricted case where the ordering of the edges builds the graph in a connected fashion. Let $chi_c(G)$ be the minimum number of colours involved following such an ordering. We show that it is NP-hard to determine whether $chi_c(G)>chi(G)$. We prove that $chi(G)=chi_c(G)$ if $G$ is bipartite, and that $chi_c(G)leq 4$ if $G$ is subcubic.
An $alpha$-greedy balanced pair in an ordered set $P=(V,leq)$ is a pair $(x,y)$ of elements of $V$ such that the proportion of greedy linear extensions of $P$ that put $x$ before $y$ among all greedy linear extensions is in the real interval $[alpha,
1-alpha]$. We prove that every $N$-free ordered set which is not totally ordered has a $frac{1}{2}$-greedy balanced pair.
The recently developed theory of Schur rings over a finite cyclic group is generalized to Schur rings over a ring R being a product of Galois rings of coprime characteristics. It is proved that if the characteristic of R is odd, then as in the cyclic
group case any pure Schur ring over R is the tensor product of a pure cyclotomic ring and Schur rings of rank 2 over non-fields. Moreover, it is shown that in contrast to the cyclic group case there are non-pure Schur rings over R that are not generalized wreath products.
We study F-saturation games, first introduced by Furedi, Reimer and Seress in 1991, and named as such by West. The main question is to determine the length of the game whilst avoiding various classes of graph, playing on a large complete graph. We sh
ow lower bounds on the length of path-avoiding games, and more precise results for short paths. We show sharp results for the tree avoiding game and the star avoiding game.
A universal cycle for permutations of length $n$ is a cyclic word or permutation, any factor of which is order-isomorphic to exactly one permutation of length $n$, and containing all permutations of length $n$ as factors. It is well known that univer
sal cycles for permutations of length $n$ exist. However, all known ways to construct such cycles are rather complicated. For example, in the original paper establishing the existence of the universal cycles, constructing such a cycle involves finding an Eulerian cycle in a certain graph and then dealing with partially ordered sets. In this paper, we offer a simple way to generate a universal cycle for permutations of length $n$, which is based on applying a greedy algorithm to a permutation of length $n-1$. We prove that this approach gives a unique universal cycle $Pi_n$ for permutations, and we study properties of $Pi_n$.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
