Open Problems in Combinatorial Group Theory (second edition), Contemp. Math., vol. 296, Amer. Math. Soc. (2002), pp. 1-38 CrossrefGoogle Scholar [2] A.F. Beardon Pell's equation and two generator free Möbius groups Bull. Lond. Math. Soc., 25 (1993), pp. 527-532 CrossrefView...
We prove that there is an algorithm to decide whether or not a given word in F 2 is potentially positive, which gives an affirmative solution to problem F34a in [G. Baumslag, A.G. Myasnikov, V. Shpilrain, Open problems in combinatorial group theory, second ed., in: Contemp. Math....
Sagan, B.E.: The Symmetric Group Representations, Combinatorial Algorithms, and Symmetric Functions. Springer, New York (2001) MATH Google Scholar Scott, J.: Block-Toeplitz determinants, chess tableaux, and the type A1^ Geiss–Leclerc–Schroer ϕ-map (2007). Available at arxiv:0707.3046 Stan...
The Resource Constrained Project Scheduling Problem (RCPSP) is one of the most challenging problems in the field of scheduling and combinatorial optimizati... M Mobini,Z Mobini,M Rabbani - 《Applied Soft Computing》 被引量: 94发表: 2011年 Single Machine Group Scheduling Problems with the Effects...
extracting the polynomial dependence on the dimension d by solving an additional (d-dependent) recurrence in terms of a purely combinatorial function (section 4.1), the latter of which could finally be determined by comparing with the special-index cases (we explain this step in section 4.2). ...
We expect that the successful implementation of a combinatorial approach using hybrid rice technology will play a crucial role in our effort to improve rice cultivars in China. The immediate goal is to breed varieties with a further improved yield potential, enhanced ...
Quantum annealers are commercial devices that aim to solve very hard computational problems1, typically those involving spin glasses2,3. Just as in metallurgic annealing, in which a ferrous metal is slowly cooled4, quantum annealers seek good solutions b
This assignment problem is a classic in combinatorial optimization theory, and to obtain the solution we can rely on the Hungarian algorithm developed by Kuhn (1955) and Munkres (1957).11 We think of a club as a long-lasting institution rather than as an ad hoc arrangement. Our assumption ...
However, this is very impractical, because of the combinatorial explosion that would result from building every possible pair of transformed stimuli (especially when the stimuli are transformed along many different dimensions – size, position, in-plane rotation, etc.). As shown in Section 5, a ...
In Proposition 6.16 we saw that the problem of classifying subcategories of S0 and finding their generators can be devolved to the analogous tasks for another, simpler class of combinatorial objects, bracket pattern categories (see Subsection 7.1). These two reduced problems are the object of this...