Related papers: Solutions to some problems on unique representatio…
Recently, Andrews and EI Bachraoui obtained several iden tities on two-colored partitions. While solving open problems they posed, Chen and Zhou derived a number of identities using analytic methods and asked for combinatorial proofs. In…
Number systems with a rational number $a/b > 1$ as base have gained interest in recent years. In particular, relations to Mahler's 3/2-problem as well as the Josephus problem have been established. In the present paper we show that the…
This article studies two notions of generalized matroid representations motivated by algorithmic information theory and cryptographic secret sharing. The first (entropic representability) involves discrete random variables, while the second…
We present an alternative proof of the NEXP-hardness of the satisfiability of {\em Dependency Quantified Boolean Formulas} (DQBF). Besides being simple, our proof also gives us a general method to reduce NEXP-complete problems to DQBF. We…
The present work includes some of the author's original researches on integer solutions of Diophantine liner equations and systems. The notion of "general integer solution" of a Diophantine linear equation with two unknowns is extended to…
We study consistent query answering via different graph representations. First, we introduce solution-conflict hypergraphs in which nodes represent facts and edges represent either conflicts or query solutions. Considering a monotonic query…
Chen and Hsiao gave the numerical solution of initial value problems of systems of linear differential equations with constant coefficients by Walsh polynomials approach. This result was improved by G\'at and Toledo for initial value…
We introduce a new technique for solving uni-parametric versions of linear programs, convex quadratic programs, and linear complementarity problems in which a single parameter is permitted to be present in any of the input data. We…
We prove a coordinatization theorem for unital alternative algebras containing 2 x 2 matrix algebra with the same identity element 1. This solves an old problem announced by Nathan Jacobson on the description of alternative algebras…
Over 300 sequences and many unsolved problems and conjectures related to them are presented herein together with theorems corollaries, formulae, examples, mathematical criteria, etc. (about integer sequences, numbers, quotients, residues,…
On computers, discrete problems are solved instead of continuous ones. One must be sure that the solutions of the former problems, obtained in real time (i.e., when the stepsize h is not infinitesimal) are good approximations of the…
We give self-contained presentation of results related to the Kadison-Singer problem, which was recently solved by Marcus, Spielman, and Srivastava. This problem connects with unusually large number of areas including: operator algebras…
We introduce and study expansions of real numbers with respect to two integer bases.
These open problems were presented in the Problem Sessions held during the Tianyuan Workshop on Computability Theory and Descriptive Set Theory, June 16-20, 2025. The problems are organized into sections named after their contributors, in…
We formulate a quantized reflection equation in which $q$-boson valued $L$ and $K$ matrices satisfy the reflection equation up to conjugation by a solution to the Isaev-Kulish 3D reflection equation. By forming its $n$-concatenation along…
We greatly expand upon the results of Kochengin, Oliker and Tempeski [S. Kochengin, V. Oliker, O. von Tempeski, On the design of reflectors with prescribed distribution of virtual sources and intensities, Inverse Problems 14 (1998)…
We consider an open question posed in \cite{Zhu-Baggio-17} on the uniqueness of the solution to a parametric spectral estimation problem.
Neural networks functions are supposed to be able to encode the desired solution of an inverse problem very efficiently. In this paper, we consider the problem of solving linear inverse problems with neural network coders. First we…
One presents many Concatenated and Operation Sequences, P-Q Relationships, Digital Sequences, Magic Squares, Prime Conjectures, k-Divisibility and Strong Divisibility Sequences, Geometric Conjectures, Proposed problems.
We introduce a unified framework to compute the solution space properties of a broad class of combinatorial optimization problems. These properties include finding one of the optimum solutions, counting the number of solutions of a given…