Researcher Database

TAKAYAMA Yukihide

Department / Course College of Science and Engineering Department of Mathematical Sciences

Title / Position Professor

Papers
1.	2018/12	On equivariant formal deformation theory │ Rendiconti del Circolo Matematico di Palermo Series 2 │ 67 (3),pp.409-419 (Co-authored)
2.	2017	On Kodaira type vanishing for Calabi-Yau threefolds │ Beitraege zur Algebra und Geometrie │ 58 (1),pp.1-11 (Sole-authored)
3.	2014	Kodaira type vanishing theorem for the Hirokado variety. │ Communications in algebra │ 42 (11),pp.4744--4750 (Sole-authored)
4.	2012	Raynaud-Mukai construction and Calabi-Yau threefolds in positive characteristic │ Proc. Amer. Math. Soc. │ 140 (12),pp.4063-4074 (Sole-authored)
5.	2010	On non-vanishing of cohomologies of generalized Raynaud polarized surfaces │ Journal of pure and applied algebra │ 214 (7),pp.1110-1120 (Sole-authored)
6.	2008	Componentwise linear ideals with minimal or maximal Betti numbers │ Ark. Mat. │ 46 (1),pp.69-75 (Co-authored)
7.	2008	Generalized complete intersections with linear resolutions. │ Arch. Math. (Basel) │ 90 (5),pp.385-394 (Co-authored)
8.	2007	Monomial ideals with linear quotients whose Taylor resolutions are minimal │ Bull. Math. Soc. Sci. Math. Roumanie (N.S.) │ 50(98) (2),pp.161-166 (Co-authored)
9.	2007	Stanley-Reisner ideals whose powers have finite length cohomologies │ Proc. Amer. Math. Soc. │ 135 (8),pp.2355-2364 (Co-authored)
10.	2005	Combinatorial characterizations of generalized Cohen-Macaulay monomial ideals │ Bull. Math. Soc. Sci. Math. Roumanie (N.S.) │ 48(96) (3),pp.327-344 (Sole-authored)
11.	2005	On the radical of a monomial ideal │ Arch. Math. (Basel) │ 85 (5),pp.397-408 (Co-authored)
12.	2003	Approximations of generalized Cohen-Macaulay modules │ Illinois J. Math. │ 47 (4),pp.1287-1302 (Co-authored)
13.	2002	Resolutions by mapping cones │ Homology, Homotopy and Applications │ 4 (2),pp.277-294 (Co-authored)
14.	2001	Normality of Affine Semigroup Rings Generated by 2-dimensional Cone Type Simplicial Complexes │ ,pp.Volume 29, Number 4 (Sole-authored)
15.	1999	Steinitz' Theorem Analogue for Two-Dimensional Cohen-Macaulay Complexes │ ,pp.22, pp200-218 (Co-authored)
16.	1998	Towards Cycle Filling as Parallelization │ ,pp.Vol. 996, pp207-221 (Sole-authored)
17.	1996/04	Extraction of Concurrent Processes from Higher Dimensional Automata │ Springer-Verlag LNCS No.1059,Tree in Algebra and Programming-CAAP'96,72～86 │ ,pp.No.1059 72-86 Springer-Verlag (Sole-authored)
18.	1995	Parallelization of Concurrent Processes in Higher Dimensional Automata │ RIMS Kokyuroku │ ,pp.Vol.918,238-252 (Sole-authored)
19.	1994/04	Lifschitz's Logic of Calculable Numbers and Optimizations in Program Extraction │ Springer-Verlag/LNCS No.792, Logic, Language and Computation │ (Co-authored)
20.	1994/02	Defining Concurrent Processes Constructively │ Theoretical Computer Science │ ,pp.Vol.122,137-164 (Sole-authored)
21.	1993	QPC<ss2>2</ss2> : A Constructive Calculus with Parameterized Specifications │ Journal of Symbolic Computation │ ,pp.Vol.15 (Sole-authored)
22.	1992/06	Defining concurrent Processes Constructively │ Proceedings of International Conference on Fifth Generation Computer Systems │ (Sole-authored)
23.	1992/05	SHUTEN : A Constructive Programming System │ 7 (4) (Sole-authored)
24.	1991	Extraction of Redundancy-free Programs from Constructive Natural Deduction Proofs │ Journal of Symbolic Computation │ ,pp.Vol.12 (Sole-authored)
25.	1990/09	QPC2: A Second Order Logic for Higher Order Programming │ ,pp.No.539 (Sole-authored)
26.	1989/09	Extended Projection - a new method to extract efficient programs from constructive proofs │ Proceedings of 1989 Conference on Functional Programming and Computer Architecture,ACM │ (Sole-authored)
27.	1989	Extended Projection Method-A new method to extract efficient programs from constructive proofs │ Functional Programming Languages and Computer Architecture │
28.	1988	QPC : QJ-based Proof Compiler-Simple examples and analysis │ Springer Lecture Notes in Computer Science │ ,pp.300
29.	1987	Writing Programs as QJ-Proofs and Compiling into PROLOG Programs │ 4th Symposium on Logic Programming │