Related papers: On elementary equivalence, isomorphism and isogeny…
When formalizing mathematics in (generalized predicative) constructive type theories, or more practically in proof assistants such as Coq or Agda, one is often using setoids (types with explicit equivalence relations). In this note we…
Given two tuples of subspaces, can you tell whether the tuples are isomorphic? We develop theory and algorithms to address this fundamental question. We focus on isomorphisms in which the ambient vector space is acted on by either a unitary…
Germs of tubular neighborhood embeddings for submanifolds N of manifolds M are in one-one correspondence with germs of Euler-like vector fields near N. In many contexts, this reduces the proof of `normal forms results' for geometric…
We show that Zilber's conjecture that complex exponentiation is isomorphic to his pseudo-exponentiation follows from the a priori simpler conjecture that they are elementarily equivalent. An analysis of the first-order types in…
In this paper we classify curves of genus two over a perfect field k of characteristic two. We find rational models of curves with a given arithmetic structure for the ramification divisor and we give necessary and sufficient conditions for…
We introduce a systematic approach to express generating functions for the enumeration of maps on surfaces of high genus in terms of a single generating function relevant to planar surfaces. Central to this work is the comparison of two…
The goal of this article is to prove the comparison theorem between algebraic and topological nearby cycles of a morphism without slopes. We prove in particular that for a family of holomorphic functions without slopes, if we iterate…
We introduce (weak) oddomorphisms of graphs which are homomorphisms with additional constraints based on parity. These maps turn out to have interesting properties (e.g., they preserve planarity), particularly in relation to homomorphism…
Determining whether two graphs are structurally identical is a fundamental problem with applications spanning mathematics, computer science, chemistry, and network science. Despite decades of study, graph isomorphism remains a challenging…
From every pair of adjoint functors it is possible to produce a (possibly trivial) equivalence of categories by restricting to the subcategories where the unit and counit are isomorphisms. If we do this for the adjunction between effect…
We introduce the notion of $\lambda$-equivalence and $\lambda$-embeddings of objects in suitable categories. This notion specializes to $L_{\infty\lambda}$-equivalence and $L_{\infty\lambda}$-elementary embedding for categories of…
Simplicial surfaces describe the incidence relations between vertices, edges and faces of triangulated 2-dimensional manifolds in a purely combinatorial way. By considering only the incidences of edges and faces, simplicial surfaces are…
The nonlinear geometry of operator spaces has recently started to be investigated. Many notions of nonlinear embeddability have been introduced so far, but, as noticed before by other authors, it was not clear whether they could be…
We study basic properties of flow equivalence on one-dimensional compact metric spaces with a particular emphasis on isotopy in the group of (self-) flow equivalences on such a space. In particular, we show that an orbit-preserving such map…
Given a rational point on a curve in a rational isogeny class, a natural question concerns the field of definition of its pre-images. The multiplication by m endomorphism is a powerful and much-used tool. The pre-images for this map are…
Over 50 years ago, Lov\'{a}sz proved that two graphs are isomorphic if and only if they admit the same number of homomorphisms from any graph [Acta Math. Hungar. 18 (1967), pp. 321--328]. In this work we prove that two graphs are quantum…
Following our previous work [18], we introduce the notions of partial seed homomorphisms and partial ideal rooted cluster morphisms. Related to the theory of Green's equivalences, the isomorphism classes of sub-rooted cluster algebras of a…
A standard tool for classifying the complexity of equivalence relations on $\omega$ is provided by computable reducibility. This reducibility gives rise to a rich degree structure. The paper studies equivalence relations, which induce…
In this note, we will illuminate some immediate consequences of work done by Reineke that may prove to be useful in the study of elliptic curves. In particular, we will construct an isomorphism between the category of smooth projective…
Unanticipated connections between different fragments of lambda calculus and different families of embedded graphs (a.k.a. "maps") motivate the problem of enumerating $\beta$-normal linear lambda terms. In this brief note, it is shown (by…