Hideki Tsuiki

ORCID: 0000-0003-0854-948X
Publications
Citations
Views
---
Saved
---
About
Contact & Profiles
Research Areas
  • Computability, Logic, AI Algorithms
  • Logic, programming, and type systems
  • Logic, Reasoning, and Knowledge
  • Formal Methods in Verification
  • Mathematical Dynamics and Fractals
  • Advanced Topology and Set Theory
  • Cellular Automata and Applications
  • semigroups and automata theory
  • Digital Image Processing Techniques
  • Advanced Algebra and Logic
  • Algorithms and Data Compression
  • Homotopy and Cohomology in Algebraic Topology
  • graph theory and CDMA systems
  • Fixed Point Theorems Analysis
  • Rings, Modules, and Algebras
  • Fuzzy and Soft Set Theory
  • Parallel Computing and Optimization Techniques
  • Benford’s Law and Fraud Detection
  • Advanced Materials and Mechanics
  • Advanced Numerical Analysis Techniques
  • Machine Learning and Algorithms
  • Quasicrystal Structures and Properties
  • Genome Rearrangement Algorithms
  • Mathematics and Applications
  • Chromatography in Natural Products

Kyoto University
2013-2025

Swansea University
2017

University of South Africa
2017

University of Siegen
2017

Korea Advanced Institute of Science and Technology
2017

Kyoto Sangyo University
1994

Keio University
1994

Keio University Shonan Fujisawa
1993

The Sierpinski tetrahedron has a remarkable property: It is projected to squares in three orthogonal directions, and moreover, sets with positive Lebesgue measures numerous directions. This paper proposes method for characterizing directions along which the other similar fractal 3D objects are measures. We apply this methodology layered imaginary cubes achieve comprehensive characterization them. Layered defined as attractors of iterated function systems structures, they Within class,...

10.4171/jfg/163 article EN cc-by Journal of Fractal Geometry Mathematics of Fractals and Related Topics 2025-03-11

Hemolytic disease of the newborn (HDN) arising from MNSs incompatibility is rare, with few reports prolonged anemia and reticulocytopenia following HDN. We report younger 2 male siblings, both whom had anti-M-induced HDN persisting for over a month. Peripheral reticulocytes remained inappropriately low degree anemia, they needed multiple red cell transfusions. Viral infections were ruled out. Corticosteroids given suspected pure aplasia. Anemia subsequently improved. Colony-forming unit...

10.1097/mph.0000000000000341 article EN Journal of Pediatric Hematology/Oncology 2015-05-01

10.1016/s0304-3975(01)00104-9 article EN publisher-specific-oa Theoretical Computer Science 2002-07-01

10.1016/j.apal.2020.102903 article EN publisher-specific-oa Annals of Pure and Applied Logic 2020-10-09

10.1016/j.topol.2010.09.003 article EN publisher-specific-oa Topology and its Applications 2010-10-13

Every compact metric space $X$ is homeomorphically embedded in an $\omega$-algebraic domain $D$ as the set of minimal limit (that is, non-finite) elements. Moreover, a retract $L(D)$ all elements $D$. Such can be chosen so that it has property M and finite-branching, height equal to small inductive dimension $X$. We also show topological for domains with M. These results give characterisation which The we embed $n$-dimensional ($n \leq \infinity$) concrete structure consists finite/infinite...

10.1017/s0960129504004396 article EN Mathematical Structures in Computer Science 2004-11-16

We study domain representations induced by dyadic subbases and show that a proper subbase S of second-countable regular space X induces an embedding in the set minimal limit elements subdomain D $\{0,1,\perp\}\omega$. In particular, if is compact, then retract D.

10.2168/lmcs-11(1:17)2015 article EN cc-by Logical Methods in Computer Science 2015-03-31

Imaginary cubes are three dimensional objects which have square silhouette projections in orthogonal ways just as a cube has. In this paper, we study imaginary and present assembly puzzles based on them. We show that there 16 equivalence classes of minimal convex cubes, among whose representatives hexagonal bipyramid triangular antiprism cube. Our main puzzle is to put the former six latter pieces into cube-box with an edge length twice size original Solutions remarkable properties these two...

10.3390/a5020273 article EN cc-by Algorithms 2012-05-09

A dyadic subbase S of a topological space X is consisting countable collection pairs open subsets that are exteriors each other. If proper, then we can construct dcpo D in which embedded. We study properties with respect to two aspects. (i) Whether the consistently complete depends on not only itself but also enumeration . give characterization induces consistent completeness regardless its enumeration. (ii) regular Hausdorff, embedded minimal limit set an example Hausdorff non-regular such empty.

10.1017/s0960129516000207 article EN Mathematical Structures in Computer Science 2016-06-23

We explore representing the compact subsets of a given represented space by infinite sequences over Plotkin's $\mathbb{T}$. show that computably computable metric spaces admit representations their in such way sets are essentially underspecified points. can even ensure name an $n$-element set contains $n$ occurrences $\bot$. undergo this study effectively and $\mathbb{T}^\omega$-representation is obtained from structures spaces. As application, we prove some statements about Weihrauch degree...

10.48550/arxiv.1604.00258 preprint EN other-oa arXiv (Cornell University) 2016-01-01

We consider three-dimensional extensions of the Sudoku puzzle over prefractal objects. The objects we use are 2nd-level cubic approximations two 3D fractals. Both composed 81 pieces and they have 9 × 9-grid appearances in three orthogonal directions. On each object, our problem is to assign a digit so that it has solution pattern appearances. In this paper, present an algorithm for enumerating such assignments show results.

10.2197/ipsjjip.20.667 article EN Journal of Information Processing 2012-01-01

The notions of a proper dyadic subbase and an independent was introduced by H. Tsuiki to investigate in {0, 1, bot}-sequence codings topological spaces. We show that every separable metrizable space has whose restriction the perfect set defined Cantor-Bendixson theorem forms restricted space.

10.48550/arxiv.1305.3393 preprint EN other-oa arXiv (Cornell University) 2013-01-01

10.1016/j.jlap.2004.07.005 article EN publisher-specific-oa The Journal of Logic and Algebraic Programming 2004-10-12
Coming Soon ...