相关论文: Nonisomorphic Ordered Sets with Arbitrarily Many R…

This paper studies three natural pre-orders of increasing generality on the set of all completely non-unitary partial isometries with equal defect indices. We show that the problem of determining when one partial isometry is less than…

We introduce a subclass of recursive subhomogeneous algebras, in which each of the pullback maps is diagonal in a suitable sense. We define the notion of a diagonal map between two such algebras and show that every simple inductive limit of…

We give an algorithm that, for every fixed k, decides isomorphism of graphs of rank width at most k in polynomial time. As the clique width of a graph is bounded in terms of its rank width, we also obtain a polynomial time isomorphism test…

For each odd integer $k\ge 5$, we prove that, if $M$ is a simple rank-$r$ binary matroid with no odd circuit of length less than $k$ and with $|M| > k 2^{r-k+1}$, then $M$ is isomorphic to a restriction of the rank-$r$ binary affine…

In \cite{HigherGnk}, the author has constructed natural maps from fundamental groups of topological spaces (restricted configuration spaces) to the groups $G_{n}^{k}$. In the present paper, we show that in the case of $n=k+1$, the group…

Recently, the authors have proved the finiteness of common zeros of two iterated rational maps under some compositional independence assumptions. In this article, we advance towards a question of Hsia and Tucker on a Zariski non-density of…

For $n \in \mathbb{N}$, let $[n] = \{1, 2, \ldots, n\}$ be an $n$ - element set. As usual, we denote by $I_n$ the symmetric inverse semigroup on $[n]$, i.e. the partial one-to-one transformation semigroup on $[n]$ under composition of…

Building on recent work of Robertson and Steger, we associate a C*-algebra to a combinatorial object which may be thought of as a higher rank graph. This C*-algebra is shown to be isomorphic to that of the associated path groupoid.…

We extend to characteristic $2$ and $3$ the classification of projective homogeneous varieties of Picard group isomorphic to $\mathbf{Z}$, corresponding to parabolic subgroup schemes with maximal reduced subgroup. The latter are all…

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…

For which (first-order complete, usually countable) $T$ do there exist non-isomorphic models of $T$ which become isomorphic after forcing with a forcing notion $\mathbb{P}$? Necessarily, $\mathbb{P}$ is non-trivial; i.e.~it adds some new…

In this article we prove in the main theorem that, there is a bijection between the isomorphism classes of a certain type of real hyperplane arrangements on the one hand, and the antipodal pairs of convex cones of an associated…

There are typically several nonisomorphic graphs having a given degree sequence, and for any two degree sequence terms it is often possible to find a realization in which the corresponding vertices are adjacent and one in which they are…

We prove that isomorphism of tournaments of twin width at most $k$ can be decided in time $k^{O(\log k)}n^{O(1)}$. This implies that the isomorphism problem for classes of tournaments of bounded or moderately growing twin width is in…

Multiple network alignment is the problem of identifying similar and related regions in a given set of networks. While there are a large number of effective techniques for pairwise problems with two networks that scale in terms of edges,…

Let $A$ be an arbitrary symmetrizable Cartan matrix of rank $r$, and ${\bf n}={\bf n_+}$ be the standard maximal nilpotent subalgebra in the Kac-Moody algebra associated with $A$ (thus, ${\bf n}$ is generated by $E_1,\ldots,E_r$ subject to…

We study noncrossing geometric graphs and their disjoint compatible geometric matchings. Given a cycle (a polygon) P we want to draw a set of pairwise disjoint straight-line edges with endpoints on the vertices of P such that these new…

Let $X_{2k}$ be a set of $2k$ labeled points in convex position in the plane. We consider geometric non-intersecting straight-line perfect matchings of $X_{2k}$. Two such matchings, $M$ and $M'$, are disjoint compatible if they do not have…

A graph G is said to be orderenergetic, if its energy equal to its order and it is said to be hypoenergetic if its energy less than its order. Two non-isomorphic graphs of same order are said to be equienergetic if their energies are equal.…

We consider the oriented graph whose vertices are isomorphism classes of finitely generated groups, with an edge from G to H if, for some generating set T in H and some sequence of generating sets S_i in G, the marked balls of radius i in…