The research of the present paper relates a contribution to the application of graph theory in fabric design. Instead of choosing random samples we prefer here to develop a combinatorial approach which simulates chaos, relying on a Hamiltonian circuit algorithm applied to state transition graph. The theorem and corollary concerning the Hamiltonian method for the moss-crepe 6 shafts are presente...

We present an algorithm for the design of either combinatorial or discrete informative libraries. This approach is based on information theoretic techniques used extensively in coding theory. We have extended the information theoretic formalism to include an arbitrary number of property distribution constraints, such as Lipinski "drug-like" distributions. The method is demonstrated by comparing...

[IMD] Introduction to mechanism design (for computer scientists), by N. Nisan. In N. Nisan, T. Roughgarden, E. Tardos, and V. Vazirani, editors, Algorithmic Game Theory, chapter 9. Cambridge University Press, 2007. [CAs] Combinatorial Auctions, by L. Blumrosen and N. Nisan. In N. Nisan, T. Roughgarden, E. Tardos, and V. Vazirani, editors, Algorithmic Game Theory, chapter 11. Cambridge Universit...

My interest in combinatorics began six years ago when I was studying in the laboratory of Professor Sanpei Kageyama at Hiroshima University as an undergraduate student. I started my study for combinatorics with reading the famous book " Introduction to Combinatorial Theory " written by R.C. Bose and B. Manvel. After one and a half years, I decided to enter Nagoya University and join the laborat...

We survey the field of combinatorial representation theory, describe the main results and main questions and give an update of its current status. Answers to the main questions are given in Part I for the fundamental structures, Sn and GL(n, C ), and later for certain generalizations, when known. Background material and more specialized results are given in a series of appendices. We give a per...

Aim: To present a systematic development of the theory of combinatorial games from the ground up. Approach: Computational complexity. Combinatorial games are completely determined; the questions of interest are efficiencies of strategies. Methodology: Divide and conquer. Ascend from Nim to Chess in small strides at a gradient that’s not too steep. Presentation: Largely informal; examples of com...

Background. The integer distance graph G(Z, D) with distance set D = {d1, d2, . . .} has the set of integers Z as the vertex set and two vertices x, y ∈ Z are adjacent if and only if |x − y| ∈ D. The integer distance graphs (under Euclidean norm) were first systematically studied by Eggleton–Erdős–Skilton in 1985 [12, 13], and have been investigated in many ways [50, 56, 57, 61]. One of main go...