27 citations · 31 across the 5 of their papers we have counts for
5 papers
Ehrhart series for Connected Simple Graphs
Tetsushi Matsui
The Ehrhart ring of the edge polytope for a connected simple graph is known to coincide with the edge ring of the same graph if satisfies the odd cycle cond…
NZMATH 1.0
Satoru Tanaka, Naoki Ogura, Ken Nakamula +2
This is an announcement of the first official release ver.1.0 of a Python system NZMATH for number theory. We overview all functions in NZMATH 1.0, show main properties after forme…
Roots of Ehrhart polynomials arising from graphs
Tetsushi Matsui, Akihiro Higashitani, Yuuki Nagazawa +2
Several polytopes arise from finite graphs. For edge and symmetric edge polytopes, in particular, exhaustive computation of the Ehrhart polynomials not merely supports the conjectu…
On Polynomial Time Computable Numbers
Tetsushi Matsui
It will be shown that the polynomial time computable numbers form a field, and especially an algebraically closed field.
A Note on Bulk Quantum Turing Machine
Tetsushi Matsui
Recently, among experiments for realization of quantum computers, NMR quantum computers have achieved the most impressive succession. There is a model of the NMR quantum computatio…