5 citations · 7 across the 6 of their papers we have counts for
6 papers
Conformal dimensionality reduction / increase
Nicholas J. Daras
We give two low-complexity algorithms, one for dimensionality reduction and one for dimensionality increase, which are applicable to any dataset, regardless of whether the set has…
Post-quantum encryption algorithms of high-degree 3-variable polynomial congruences: BS cryptosystems and BS key generation
Nicholas J. Daras
We will construct post-quantum encryption algorithms based on three-variable polynomial Beal-Schur congruence. After giving a proof of Beal's conjecture and citing some application…
A Constructive Proof of Beal's Conjecture
Nicholas J. Daras
We prove that there is no non-trivial integral positive solution to the generalized Fermat equation.
Universal Padé approximants on simply connected domains
N. Daras, G. Fournodavlos, V. Nestoridis
The theory of universal Taylor series can be extended to the case of Padé approximants where the universal approximation is not realized by polynomials any more, but by rational fu…
Universal Taylor Series On Convex Subsets Of $\Mathbb{C}^{N}$
Nicholas J. Daras, Vassili Nestoridis
We prove the existence of holomorphic functions defined on any open convex subset , whose partial sums of the Taylor developments approximate unif…
Universal Padé Approximation
Nicholas J. Daras, Vassili Nestoridis
In transferring some results from universal Taylor series to the case of Padé approximants we obtain stronger results, such as, universal approximation on compact sets of arbitrary…