Related papers: Hirotaka's problem 028
We investigate in this work the problem of Erasure Combinatorial Batch Codes, in which $n$ files are stored on $m$ servers so that every set of $n-r$ servers allows a client to retrieve at most $k$ distinct files by downloading at most $t$…
The invariant subspace problem is solved correcting my earlier attempts [6]-[12].
We explore both automated and human approaches to the generalized Missionaries and Cannibals problem.
In this paper we study a cooperative card game called Hanabi from the viewpoint of algorithmic combinatorial game theory. In Hanabi, each card has one among $c$ colors and a number between $1$ and $n$. The aim is to make, for each color, a…
Explaining unsolvability of planning problems is of significant research interest in Explainable AI Planning. AI planning literature has reported several research efforts on generating explanations of solutions to planning problems.…
In this note, we first introduce a new problem called the longest common subsequence and substring problem. Let $X$ and $Y$ be two strings over an alphabet $\Sigma$. The longest common subsequence and substring problem for $X$ and $Y$ is to…
This paper addresses the challenges faced by algorithms, such as the Firefly Algorithm (FA) and the Genetic Algorithm (GA), in constrained optimization problems. While both algorithms perform well for unconstrained problems, their…
This very preliminary text is related to ``Algorithms on Texts'', also called ``Algorithmic Stringology''. It is an extension of the book ``125 Problems in Text Algorithms'' providing, in the same compact style, more problems with…
In this paper we study the Dirichlet problem for a class of Hessian type equation with its structure as a combination of elementary symmetric functions on Hermitian manifolds. Under some conditions with the initial data on manifolds and…
This is a survey of the exciting recent progress made in understanding the complexity of distributed subgraph finding problems. It overviews the results and techniques for assorted variants of subgraph finding problems in various models of…
Pattern-Based Constraint Satisfaction and Logic Puzzles develops a pure logic, pattern-based perspective of solving the finite Constraint Satisfaction Problem (CSP), with emphasis on finding the "simplest" solution. Different ways of…
Following on from ``Hyperbolic Plateau problems'' (by the same author), we provide a complete geometric description of solutions to the Plateau problem $(S,\phi)$ when $S$ is a compact Riemann surface with a finite number of points removed.
In open-source software development environments; textual, numerical and relationship-based data generated are of interest to researchers. Various data sets are available for this data, which is frequently used in areas such as software…
We revisit the Cauchy problem for the logarithmic Schr\"odinger equation and construct strong solutions in $H^1$, the energy space, and the $H^2$-energy space. The solutions are provided in a constructive way, which does not rely on…
A conformal geometry determines a distinguished, potentially singular, variant of the usual Yamabe problem, where the conformal factor can change sign. When a smooth solution does change sign, its zero locus is a smoothly embedded…
Two mathematical aspects of the centuries-old Japanese sashiko stitching form hitomezashi are discussed: the encoding of designs using words from a binary alphabet, and duality. Traditional hitomezashi designs are analysed using these two…
We introduce a new class of optimization problems called integer Minkowski programs. The formulation of such problems involves finitely many integer variables and nonlinear constraints involving functionals defined on families of discrete…
Let k be a subfield of a p-adic field of odd residue characteristic, and let L be the function field of a variety of dimension n >= 1 over k. Then Hilbert's Tenth Problem for L is undecidable. In particular, Hilbert's Tenth Problem for…
We review the current state of the homogeneous Banach space problem. We then formulate several questions which arise naturally from this problem, some of which seem to be fundamental but new. We give many examples defining the bounds on the…
We give an historical account, including recent progress, on some problems of Erd\H os in number theory.