AUTHOREA
Log in Sign Up Browse Preprints
LOG IN SIGN UP
Philipp Harland
Philipp Harland
Independent Researcher
Somewhere in America.

Public Documents 22
A Method for Mapping Graphs to Real Metric Space
Philipp Harland

Philipp Harland

June 05, 2025
In this paper, we will be detailing a method to embed graphs into the 2-dimensional real plane, R. We will also extend the result to hypergraphs. We will also be examining some of the immediate theory that comes from this.
An Approach to the Generalization of Lattice Theory -The introduction of "Overpacked...
Philipp Harland

Philipp Harland

June 03, 2025
This paper will discuss and give some results on direct generalizations of mathematical lattices (discrete, periodic subgroups of an n-dimensional space), which we will call "overpacked lattices", and introduce a new method of classifying these lattices.
An Approach to the Theory of Multidimensional Elliptic Curves
Philipp Harland

Philipp Harland

June 02, 2025
In this paper, we will be presenting an approach to generalizing the theory of elliptic curves. This paper, to summarize broadly, will be the documentation of the results of a research project centered around a certain generalization of elliptic curves, namely a "multidimensional elliptic curve".
Generalizing Engel Sinks To Other Algebraic Structures
Philipp Harland

Philipp Harland

June 02, 2025
In this paper, we will be proposing a generalization of the theory of Engel sinks to other algebraic structures, of which the original theory for groups was developed predominantly by P. Shumyatsky and E.I. Khukhro, following a series of 8 papers together.
Homotopy Shields over Sets in R n , n ∈ Z +
Philipp Harland

Philipp Harland

June 02, 2025
In this paper, we will be defining the concept of a "homotopy shield" over a set in R n , and then documenting some immediate properties of its definition w.r.t. both binary and multiary contexts.
An Approach to Generalized Least Significant Bit Steganography
Philipp Harland

Philipp Harland

May 29, 2025
Least significant bit (LSB) steganography, as commonly known, operates in Z * 2 , or, binary strings. This allows it to store one byte every 3 pixels, which is rather wasteful. Here, we propose a method for constructing a form of generalized LSBS, or, generalized least significant bit steganography.
The Discrete uniform Distribution is The Most Secure for Random Key Distributions
Philipp Harland

Philipp Harland

May 29, 2025
A document by Philipp Harland. Click on the document to view its contents.
Tensor Products for Cryptography: A Brief Paper
Philipp Harland

Philipp Harland

May 29, 2025
In this paper, we will explore some of the theory and uses of the tensor product in the cryptography and steganography. We will look over a few brief examples of methods using tensor products in practice in the duration of this paper.
An Algorithm Using Modular Forms for Random Number Generation
Philipp Harland

Philipp Harland

May 29, 2025
In this paper, we will go over a novel method to create pseudorandom number generation, this specific algorithm using modular forms to achieve that goal.
Analysis on P. Oxy. 90 and Verdict (Rev. as of 8/5/25 etc.)
Philipp Harland

Philipp Harland

May 28, 2025
In this paper, we will be taking an overview of a set of results from study of P. Oxy. 90, or Papyrus Oxyrhynchus 90, and giving a verdict as to if P. Oxy. 90 truly contains meaningful text or not.
← Previous 1 2 Next →

| Powered by Authorea.com

  • Home