Publications

This page opens with representative papers and the clearest entry points, then moves to the full record in reverse chronological order. Reading from the top gives the quickest sense of the current themes and a sensible order to continue.

Representative Papers

On this page, the same three papers appear before the archive as reading entry points: current direction first, then the q-polymatroid side, and then the coding-theory side.

Why These Three Come First

Once you have the thesis and the reading order from these three papers, the full archive is where to continue into neighbouring papers.

Closest to the Current Direction
arXiv preprint arXiv:2603.08016, 2026
On Representing Matroids via Modular Independence
Koji Imamura, Keisuke Shiromoto
Plain-language summary
Some matroids become representable once fields are replaced by finite chain rings. This paper explains how to recognise that situation and how it connects to codes.
Technical summary
Using modular independence over local commutative rings, it gives criteria for representability over finite chain rings and describes the correspondence with codes.
Why start here
It is the clearest current entry point to the finite-ring representability side of the project and its links with codes.
What it asks
It asks which matroids are representable over finite chain rings through modular independence arising from local commutative rings.
What it shows
It gives criteria for representability over finite chain rings together with a correspondence to codes.
Why it matters
It matters because it presents finite-ring representability and code correspondences together as a central current direction.
Collaboration fit
A useful starting point for collaborations connecting representability over finite rings with coding-theoretic questions.
Read next
Then see the coding-theory side
PDF(opens in a new tab)arXiv(opens in a new tab)
Entry Point to q-polymatroids
Discrete Math., 347(5), Paper No. 113924, 13, 2024
Critical problem for a q-analogue of polymatroids
Koji Imamura, Keisuke Shiromoto
Plain-language summary
This paper identifies the critical problem to ask for q-polymatroids and supplies basic examples that make the framework usable.
Technical summary
It formulates the critical problem for q-polymatroids and introduces q-analogues of minimal blocks together with explicit examples.
Why start here
It provides the basic vocabulary and a concrete starting point for the q-polymatroid side of the work.
What it asks
It asks how to formulate a q-polymatroid analogue of the classical critical problem.
What it shows
It formulates the critical problem and gives q-analogues of minimal blocks together with concrete examples.
Why it matters
It matters because it supplies the basic vocabulary and a starting point for entering the q-polymatroid side.
Collaboration fit
A useful collaboration entry point around q-polymatroids, finite geometry, and the critical problem.
Read next
Then see q-matroid extendability
DOI(opens in a new tab)MathSciNet(opens in a new tab)
Coding-Theory Side
Finite Fields Appl., 76, Paper No. 101900, 14, 2021
Critical Problem for codes over finite chain rings
Koji Imamura, Keisuke Shiromoto
Plain-language summary
This paper gives upper bounds on how large the critical exponent of a code over a finite chain ring can be.
Technical summary
It studies the critical problem for codes over finite chain rings and proves upper bounds for the critical exponent.
Why start here
On the coding-theory side, it most clearly shows how the project leads to concrete quantitative results.
What it asks
It asks what quantitative constraints the critical problem imposes for codes over finite chain rings.
What it shows
It establishes upper bounds for the critical exponent of codes over finite chain rings.
Why it matters
It matters because it most clearly shows the coding-theory side leading to a concrete quantitative result.
Collaboration fit
A useful entry point for collaborations on finite-chain-ring codes and their quantitative problems.
Read next
Then see the current finite-ring direction
DOI(opens in a new tab)MathSciNet(opens in a new tab)

Start with These Two Papers

If you are new to my work, these two papers are the clearest way to grasp the current main themes and a sensible reading order.

Why Read This First
A clear entry point to the current main direction: the representation problem over finite rings and its correspondence with codes.
Recommended for
Recommended for readers who want the clearest view of the current main direction: representability over finite rings and its correspondence with codes.
On Representing Matroids via Modular Independence
Koji Imamura, Keisuke Shiromoto - arXiv preprint arXiv:2603.08016, 2026
Preprint studying matroid representations via modular independence over local commutative rings, giving criteria for representability over finite chain rings and connections with codes.
What it asks
It asks which matroids are representable over finite chain rings through modular independence arising from local commutative rings.
What it shows
It gives criteria for representability over finite chain rings together with a correspondence to codes.
Why it matters
It matters because it presents finite-ring representability and code correspondences together as a central current direction.
Collaboration fit
A useful starting point for collaborations connecting representability over finite rings with coding-theoretic questions.
Read next
Then see the coding-theory side
PDF(opens in a new tab)arXiv(opens in a new tab)
Why Read This First
A good entry point to the critical problem for q-polymatroids, with the formulation and representative examples together.
Recommended for
Recommended for readers entering from the q-polymatroid side and wanting the formulation of the critical problem together with basic examples.
Critical problem for a q-analogue of polymatroids
Koji Imamura, Keisuke Shiromoto - Discrete Math., 347(5), Paper No. 113924, 13, 2024
Formulates the critical problem for a q-analogue of polymatroids, and gives q-analogues of minimal blocks together with concrete examples.
What it asks
It asks how to formulate a q-polymatroid analogue of the classical critical problem.
What it shows
It formulates the critical problem and gives q-analogues of minimal blocks together with concrete examples.
Why it matters
It matters because it supplies the basic vocabulary and a starting point for entering the q-polymatroid side.
Collaboration fit
A useful collaboration entry point around q-polymatroids, finite geometry, and the critical problem.
Read next
Then see q-matroid extendability
DOI(opens in a new tab)MathSciNet(opens in a new tab)

Start Here by Purpose

Choose the clearest first step for your purpose.

For Evaluation
Start with the representative papers for the thesis, then use the full list for the record and neighbouring strands.
Go to representative papers
For Collaboration
Start with the current directions to see the questions and papers where collaboration is most likely to connect.
Go to current directions
For First-Time Readers & Non-specialists
Start with the two suggested papers for the quickest route into the questions and reading order.
Start with the two papers

Related Pages and Profiles

Quick links to the research map, current directions, the CV, contact details, and research profiles.

Publications

Representative Papers

On Representing Matroids via Modular Independence

Critical problem for a q-analogue of polymatroids

Critical Problem for codes over finite chain rings

Start with These Two Papers

Start Here by Purpose

Related Pages and Profiles

Full Publications List

2026

On Representing Matroids via Modular Independence(opens in a new tab)

Periodicity of weight enumerators for codes generated by an integral matrix(opens in a new tab)

2021

Critical Problem for codes over finite chain rings(opens in a new tab)

More pages

Publications

Representative Papers

On Representing Matroids via Modular Independence

Critical problem for a q-analogue of polymatroids

Critical Problem for codes over finite chain rings

Start with These Two Papers

Start Here by Purpose

Related Pages and Profiles

Full Publications List

Publication filters

2026

On Representing Matroids via Modular Independence(opens in a new tab)

Periodicity of weight enumerators for codes generated by an integral matrix(opens in a new tab)

2021

Critical Problem for codes over finite chain rings(opens in a new tab)