English
Related papers

Related papers: Topological classification of chains of linear map…

200 papers

Two structures are said to be equimorphic if each embeds in the other. Such structures cannot be expected to be isomorphic, and in this paper we investigate the special case of linear orders, here also called chains. In particular we…

Combinatorics · Mathematics 2014-07-11 C. Laflamme , M. Pouzet , R. Woodrow

We introduce and discuss the dual of a chain geometry. Each chain geometry is canonically isomorphic to its dual. This allows us to show that there are isomorphisms of chain geometries that arise from antiisomorphisms of the underlying…

Algebraic Geometry · Mathematics 2024-02-13 Andrea Blunck , Hans Havlicek

We show that if two tensor algebras of topological graphs are algebraically isomorphic, then the graphs are locally conjugate. Conversely, if the base space is at most one dimensional and the edge space is compact, then locally conjugate…

Operator Algebras · Mathematics 2010-04-06 Kenneth R. Davidson , Jean Roydor

We prove that if two path algebras with homogeneous relations are isomorphic as algebras, then they are isomorphic as graded path algebras. This extends a result by Bell and Zhang in the connected case.

Rings and Algebras · Mathematics 2021-04-23 Jason Gaddis

We introduce a notion of equivalence on tilings which is formulated in terms of their local structure. We compare it with the known concept of locally deriving one tiling from another and show that two tilings of finite type are…

Condensed Matter · Physics 2009-10-28 Johannes Kellendonk

We prove the existence of lattice isomorphic line arrangements having $\pi_1$-equivalent or homotopy-equivalent complements and non homeomorphic embeddings in the complex projective plane. We also provide two explicit examples, one is…

Geometric Topology · Mathematics 2018-01-10 Benoît Guerville-Ballé

Two non-isomorphic graphs are twins if each is isomorphic to a subgraph of the other. We prove that a rayless graph has either infinitely many twins or none.

Combinatorics · Mathematics 2009-11-20 A. Bonato , H. Bruhn , R. Diestel , P. Sprüssel

We consider all compatible topologies of an arbitrary finite-dimensional vector space over a non-trivial valuation field whose metric completion is a locally compact space. We construct the canonical lattice isomorphism between the lattice…

General Topology · Mathematics 2023-12-01 Takanobu Aoyama

We prove that a topological group is isomorphic to the real line if and only if it is a one-parameteric, metrizable, and not monothetic. This result is used in the authors' other paper to prove that one-parametric groups in strictly convex…

Group Theory · Mathematics 2025-12-02 Taras Banakh , Kateryna Makarova , Oles Mazurenko

A map $f: \ff^n \to \ff^n$ over a field $\ff$ is called affine if it is of the form $f(x)=Ax+b$, where the matrix $A \in \ff^{n\times n}$ is called the linear part of affine map and $b \in \ff^n$. The affine maps over $\ff=\rr$ or $\cc$ are…

K-Theory and Homology · Mathematics 2009-02-11 Budnytska Tetiana

A graph is said to be circular-arc if the vertices can be associated with arcs of a circle so that two vertices are adjacent if and only if the corresponding arcs overlap. It is proved that the isomorphism of circular-arc graphs can be…

Data Structures and Algorithms · Computer Science 2019-07-15 Roman Nedela , Ilia Ponomarenko , Peter Zeman

We give a method for constructing a regularizing decomposition of a matrix pencil, which is formulated in terms of the linear mappings. We prove that two pencils are topologically equivalent if and only if their regularizing decompositions…

Representation Theory · Mathematics 2014-05-06 Vyacheslav Futorny , Tetiana Rybalkina , Vladimir V. Sergeichuk

We prove that there exists an algorithm for determining whether two piecewise-linear spatial graphs are isomorphic. In its most general form, our theorem applies to spatial graphs furnished with vertex colorings, edge colorings and/or edge…

Geometric Topology · Mathematics 2024-05-22 Stefan Friedl , Lars Munser , José Pedro Quintanilha , Yuri Santos Rego

Our aim is to generalize the result that two generic complex line arrangements are equivalent. In fact for a line arrangement A we associate its defining polynomial, the product of a_ix+b_iy+c_i, so that A = (f=0). We prove that the…

Geometric Topology · Mathematics 2012-06-27 Arnaud Bodin

A topological monoid is isomorphic to an endomorphism monoid of a countable structure if and only if it is separable and has a compatible complete ultrametric such that composition from the left is non-expansive. We also give a topological…

Logic · Mathematics 2018-10-16 Manuel Bodirsky , Friedrich Martin Schneider

The following numerical control over the topological equivalence is proved: two complex polynomials in $n\not= 3$ variables and with isolated singularities are topologically equivalent if one deforms into the other by a continuous family of…

Algebraic Geometry · Mathematics 2007-05-23 Arnaud Bodin , Mihai Tibar

We give a short, topological proof that all graphs admit tree-decompositions displaying their topological ends.

Combinatorics · Mathematics 2021-12-03 Max Pitz

We show that a topometric space $X$ is topometrically isomorphic to a type space of some continuous first-order theory if and only if $X$ is compact and has an open metric (i.e., satisfies that $\{p : d(p,U) < \varepsilon\}$ is open for…

Logic · Mathematics 2021-06-28 James Hanson

A topological space is called a submetrizable if it can be mapped onto a metrizable topological space by a continuous one-to-one map. In this paper we answer two questions concerning sequence-covering maps on submetrizable spaces.

General Topology · Mathematics 2024-02-20 Vlad Smolin

We show that the groupoids of two directed graphs are isomorphic if and only if the two graphs are orbit equivalent by an orbit equivalence that preserves isolated eventually periodic points. We also give a complete description of the…

Dynamical Systems · Mathematics 2018-10-08 Toke Meier Carlsen , Marius Lie Winger
‹ Prev 1 2 3 10 Next ›