Related papers: When does the table theorem imply a solution to th…
We use the square peg problem for smooth curves to prove a generalized table Theorem for real valued functions on Riemannian surfaces with odd Euler characteristic. We then use this result to prove the table conjecture for even functions on…
The presented work focuses on problems from determinant theory, set theory and topology. The term graph is the binding element that connects these problems. Graphs are distinguished by their geometrical simplicity, which helps in showing…
Toeplitz's Square Peg Problem asks whether every continuous simple closed curve in the plane contains the four vertices of a square. It has been proved for various classes of sufficiently smooth curves, some of which are dense, none of…
Let $E,F$ be two topological spaces and $u:E\rightarrow F$ be a map. \ If $F$ is Haudorff and $u$ is continuous, then its graph is closed. \ \ The Closed Graph Theorem establishes the converse when $E$ and $F$ are suitable objects of…
There exists an exact relationship between the quasi-exactly solvable problems of quantum mechanics and models of square and rectangular random complex matrices. This relationship enables one to reduce the problem of constructing…
The Union Closed Sets Conjecture is one of the most renowned problems in combinatorics. Its appeal lies in the simplicity of its statement contrasted with the potential complexity of its resolution. The conjecture posits that, in any union…
The square peg problem asks whether every continuous curve in the plane that starts and ends at the same point without self-intersecting contains four distinct corners of some square. Toeplitz conjectured in 1911 that this is indeed the…
The square peg problem asks whether every Jordan curve in the plane has four points which form a square. The problem has been resolved (positively) for various classes of curves, but remains open in full generality. We present two new…
We provide a simple proof for the union-closed sets conjecture, a long-standing open problem in set theory with immediate applications to graph theory, number theory, and order-theory.
In this note we introduce a notion of a morphism between two hyperbolic iterated function systems. We prove that the graph of a morphism is the attractor of an iterated function system, giving a Closed Graph Theorem, and show how it can be…
The presented material is devoted to the equivalent conversion from the vertex graphs to the edge graphs. We suggest that the proved theorems solve the problem of the isomorphism of graphs, the problem of the graph's enumeration with the…
In this work we present a new polynomial map $f:=(f_1,f_2):{\mathbb R}^2\to{\mathbb R}^2$ whose image is the open quadrant $\{x>0,y>0\}\subset{\mathbb R}^2$. The proof of this fact involves arguments of topological nature that avoid hard…
We discuss topological versions of the closed graph theorem, where continuity is inferred from near continuity in tandem with suitable conditions on source or target spaces. We seek internal characterizations of spaces satisfying a closed…
We resolve the periodic square peg problem using a simple Lagrangian Floer homology argument. Inscribed squares are interpreted as intersections between two non-displaceable Lagrangian sub-manifolds of a symplectic 4-torus.
Computational topology is an area that revisits topological problems from an algorithmic point of view, and develops topological tools for improved algorithms. We survey results in computational topology that are concerned with graphs drawn…
Legendre's Conjecture is one of the most elegant open problems in Number Theory, which states that there is a prime between consecutive two perfect squares. In this note, we prove the conjecture holds true and also discuss the related…
We extend the closed graph theorem and the open mapping theorem to a context in which a natural duality interchanges their extensions.
Plank problems concern the covering of convex bodies by planks in Euclidean space and are related to famous open problems in convex geometry. In this survey, we introduce plank problems and present surprising applications of plank theorems…
End-spaces of infinite graphs naturally generalise the Freudenthal boundary and sit at the interface between graph theory, geometric group theory and topology. Our main result is that every end-space can topologically be represented by a…
The Tur\'an hypergraph problem asks to find the maximum number of $r$-edges in a $r$-uniform hypergraph on $n$ vertices that does not contain a clique of size $a$. When $r=2$, i.e., for graphs, the answer is well-known and can be found in…