Related papers: A step to Gronwall's conjecture
We present an algorithm to compute path homology for simple digraphs, and use it to topologically analyze various small digraphs en route to an analysis of complex temporal networks which exhibit such digraphs as underlying motifs. The…
We prove an "abelian, locally compact" Whitehead theorem in fine shape: A fine shape morphism between locally connected finite-dimensional locally compact separable metrizable spaces with trivial $\pi_0$ and $\pi_1$ is a fine shape…
In their previous works arXiv:2105.11026, arXiv:2206.10749, Cristofaro-Gardiner, Humili\`ere, Mak, Seyfaddini and Smith defined links spectral invariants on connected compact surfaces and used them to show various results on the algebraic…
In this thesis we study the Seiberg-Witten theory of an oriented homology 3-sphere. The goal is to extract topological invariants - the Seiberg-Witten invariants - by counting the solutions to the Seiberg-Witten equations on the manifold.…
Symplectic Khovanov homology is an invariant of oriented links defined by Seidel and Smith and conjectured to be isomorphic to Khovanov homology. I define morphisms (up to a global sign ambiguity) between symplectic Khovanov homology…
In this paper, we present a constructive and proof-relevant development of graph theory, including the notion of maps, their faces, and maps of graphs embedded in the sphere, in homotopy type theory. This allows us to provide an elementary…
An isovariant map is an equivariant map between $G$-spaces which strictly preserves isotropy groups. We consider an isovariant analogue of Klein--Williams equivariant intersection theory for a finite group $G$. We prove that under certain…
Lov\'asz (1967) showed that two finite relational structures A and B are isomorphic if, and only if, the number of homomorphisms from C to A is the same as the number of homomorphisms from C to B for any finite structure C. Soon after,…
There are two theories describing the linearizability of 3-webs: one is developed in the article "On the linearizability of 3-webs" (Nonlinear analysis 47, (2001) pp.2643-2654) and another in the article "On the Blaschke conjecture for…
Graph isomorphism is a problem for which there is no known polynomial-time solution. Nevertheless, assessing (dis)similarity between two or more networks is a key task in many areas, such as image recognition, biology, chemistry, computer…
The signature transform, defined by the formal tensor series of global iterated path integrals, is a homomorphism between the path space and the tensor algebra that has been studied in geometry, control theory, number theory as well as…
A fundamental result in the study of graph homomorphisms is Lov\'asz's theorem that two graphs are isomorphic if and only if they admit the same number of homomorphisms from every graph. A line of work extending Lov\'asz's result to more…
We prove that a topological homeomorphism conjugating two generic 1-parameter unfoldings of 1-variable complex analytic resonant diffeomorphisms is holomorphic or anti-holomorphic by restriction to the unperturbed parameter. We provide…
A graph drawing in the plane is called an almost embedding if the images of any two non-adjacent simplices (i.e. vertices or edges) are disjoint. Almost embeddings (more precisely, their higher-dimensional analogues) naturally appear in…
This paper is devoted to the construction of norm-preserving maps between bounded cohomology groups. For a graph of groups with amenable edge groups we construct an isometric embedding of the direct sum of the bounded cohomology of the…
It is proven that a connected graph is planar if and only if all its cocycles with at least four edges are "grounded" in the graph. The notion of grounding of this planarity criterion, which is purely combinatorial, stems from the intuitive…
For a local analytic diffeomorphism of the plane with an irrational elliptic fixed point at 0, we introduce the notion of ``geometric normalization'', which includes the classical formal normalizations as a special case: it is a formal…
We look at the proofs of a fragment of Linear Logic as a whole: in fact, Linear Logic's coherent semantics interprets the proofs of a given formula $A$ as faces of an abstract simplicial complex, thus allowing us to see the set of the…
A tuple (s1,t1,s2,t2) of vertices in a simple undirected graph is 2-linked when there are two vertex-disjoint paths respectively from s1 to t1 and s2 to t2. A graph is 2-linked when all such tuples are 2-linked. We give a new and simple…
An isomorphism between two graphs is a bijection between their vertices that preserves the edges. We consider the problem of determining whether two finite undirected weighted graphs are isomorphic, and finding an isomorphism relating them…