78 citations · 482 across the 68 of their papers we have counts for
6 papers · 1 filter
Markov Bases for Typical Block Effect Models of Two-way Contingency Tables
Mitsunori Ogawa, Akimichi Takemura
Markov basis for statistical model of contingency tables gives a useful tool for performing the conditional test of the model via Markov chain Monte Carlo method. In this paper we…
On computation of the characteristic polynomials of the discriminantal arrangements and the arrangements generated by generic points
Yasuhide Numata, Akimichi Takemura
In this article we give a computational study of combinatorics of the discriminantal arrangements. The discriminantal arrangements are parametrized by two positive integers n and k…
Cones of elementary imsets and supermodular functions: a review and some new results
Takuya Kashimura, Tomonari Sei, Akimichi Takemura +1
In this paper we give a review of the method of imsets introduced by Studeny (2005) from a geometric point of view. Elementary imsets span a polyhedral cone and its dual cone is th…
Arrangements stable under the Coxeter groups
Hidehiko Kamiya, Akimichi Takemura, Hiroaki Terao
Let B be a real hyperplane arrangement which is stable under the action of a Coxeter group W. Then B acts naturally on the set of chambers of B. We assume that B is disjoint from t…
Convergence of random series and the rate of convergence of the strong law of large numbers in game-theoretic probability
Kenshi Miyabe, Akimichi Takemura
We give a unified treatment of the convergence of random series and the rate of convergence of strong law of large numbers in the framework of game-theoretic probability of Shafer…
A lower bound for the Graver complexity of the incidence matrix of a complete bipartite graph
Taisei Kudo, Akimichi Takemura
We give an exponential lower bound for the Graver complexity of the incidence matrix of a complete bipartite graph of arbitrary size. Our result is a generalization of the result b…