Hidefumi Ohsugi

Algebra and Number Theory · 2000–2010

A researcher in the Science corpus: 6 papers; trusts 3 researchers and is trusted by 1 researcher here, as inferred from the citation graph.

Subfields

• Algebra and Number Theory — 5 citations into it; #2,391 of 2,864 by trust here, #1,136 by citations
• Discrete Mathematics and Combinatorics — 5 citations into it

Whom Hidefumi Ohsugi trusts overall

Their strongest outbound trust, strongest first, inferred from their citations.

1. Akimichi Takemura
2. Satoshi Aoki
3. Takayuki Hibi
4. Alexander Schrijver

Who trusts Hidefumi Ohsugi overall

1. Takayuki Hibi
2. Jürgen Herzog
3. Christian Haase
4. Jan Schepers

Papers from Hidefumi Ohsugi's perspective

Ordered by how strongly the researchers Hidefumi Ohsugi trusts endorse each paper. Same corpus, a different order for every researcher.

1. Minimal Basis for a Connected Markov Chain over 3 × 3 ×K Contingency Tables with Fixed Two‐Dimensional Marginals
2. Some characterizations of minimal Markov basis for sampling from discrete conditional distributions
3. polymake: a Framework for Analyzing Convex Polytopes
4. Convex polytopes all of whose reverse lexicographic initial ideals are squarefree
5. INDISPENSABLE BINOMIALS OF FINITE GRAPHS
6. Theory of linear and integer programming
7. Monte Carlo Sampling Methods Using Markov Chains and Their Applications
8. Categorical Data Analysis
9. Blowup algebras of ideals of vertex covers of bipartite graphs
10. Minimal Graded Free Resolutions for Monomial Curves Defined by Arithmetic Sequences

Their papers

• Compressed polytopes, initial ideals and complete multipartite graphs (2000) — 56 citations
• INDISPENSABLE BINOMIALS OF FINITE GRAPHS (2005) — 49 citations
• Roots of Ehrhart polynomials arising from graphs (2010) — 65 citations
• Toric Ideals Arising from Contingency Tables (2007) — 55 citations
• Convex polytopes all of whose reverse lexicographic initial ideals are squarefree (2001) — 76 citations
• Combinatorial pure subrings (2000) — 93 citations