27 citations · 61 across the 8 of their papers we have counts for
8 papers
A Rigorous Formalism of Unconventional Symmetry Breaking in Fermi Liquid Theory and Its Application to Nematicity in FeSe
Rina Tazai, Shun Matsubara, Youichi Yamakawa +2
Unconventional symmetry breaking due to nonlocal order parameters has attracted considerable attention in many strongly correlated metals. Famous examples are the nematic order in…
Generation of odd-frequency surface superconductivity with spontaneous spin current due to the zero-energy Andreev bound state
Shun Matsubara, Yukio Tanaka, Hiroshi Kontani
We propose that the odd-frequency wave ( wave) superconducting gap function, which is usually unstable in the bulk, naturally emerges at the edge of wave supe…
Emergence of -wave superconducting state at the edge of -wave superconductors mediated by Andreev-bound-state-driven ferromagnetic fluctuations
Shun Matsubara, Hiroshi Kontani
We propose a mechanism of spin-triplet superconductivity at the edge of -wave superconductors. Recent theoretical research in -wave superconductors predicted that strong ferr…
Emergence of strongly correlated electronic states driven by the Andreev bound state in d-wave superconductors
Shun Matsubara, Hiroshi Kontani
As the surface Andreev bound state (ABS) forms at the open () edge of a -wave superconductor, the local density of states (LDOS) increases. Therefore, a strong el…
Edge-induced strongly correlated electronic states in two-dimensional Hubbard model: Enhancement of magnetic correlations and self-energy effects
Shun Matsubara, Youichi Yamakawa, Hiroshi Kontani
To understand nontrivial edge electronic states in strongly-correlated metals such as cuprate superconductors, we study the two-dimensional Hubbard models with open edge boundary.…
Two-Dimensional Indirect Binary Search for the Positive One-in-Three Satisfiability Problem
Shunichi Matsubara
In this paper, we propose an algorithm for the positive one-in-three satisfiability problem (Pos1in3SAT). The proposed algorithm can efficiently decide the existence of a satisfyin…
The Complexity of the Numerical Semigroup Gap Counting Problem
Shunichi Matsubara
In this paper, we prove that the numerical-semigroup-gap counting problem is #NP-complete as a main theorem. A numerical semigroup is an additive semigroup over the set of all nonn…
The Computational Complexity of the Frobenius Problem
Shunichi Matsubara
In this paper, as a main theorem, we prove that the decision version of the Frobenius problem is Sigma_2^P-complete under Karp reductions.Given a finite set A of coprime positive i…