English
Related papers

Related papers: Notes on the ordered set $A^A$. Part I. The classi…

200 papers

We construct automorphisms of $\C^n$ which map certain discrete sequences one onto another with prescribed finite jet at each point, thus solving a general Mittag-Leffler interpolation problem for automorphisms. Under certain circumstances,…

Complex Variables · Mathematics 2016-09-06 Gregery T. Buzzard , Franc Forstneric

Given an autohomeomorphism on an ordered topological space or its subspace, we show that it is sometimes possible to introduce a new topology-compatible order on that space so that the same map is monotonic with respect to the new ordering.…

General Topology · Mathematics 2023-06-27 Raushan Buzyakova

Ordered matchings, defined as graphs with linearly ordered vertices, where each vertex is connected to exactly one edge, play a crucial role in the area of ordered graphs and their homomorphisms. Therefore, we consider related problems from…

Computational Complexity · Computer Science 2025-12-01 Michal Čertík , Andreas Emil Feldmann , Jaroslav Nešetřil , Paweł Rzążewski

We classify embedded blowups of the real affine plane up to oriented isomorphy. We show that two blowups in the same isomorphism class are isotopic, using a matrix deformation argument similar to an idea given by Shastri. This answers two…

Commutative Algebra · Mathematics 2020-10-22 Markus Brodmann , Peter Schenzel

For each natural number $n$, we define a category whose objects are discriminant algebras in rank $n$, i.e. functorial means of attaching to each rank-$n$ algebra a quadratic algebra with the same discriminant. We show that the discriminant…

Commutative Algebra · Mathematics 2016-12-07 Owen Biesel , Alberto Gioia

We examine ordered graphs, defined as graphs with linearly ordered vertices, from the perspective of homomorphisms (and colorings) and their complexities. We demonstrate the corresponding computational and parameterized complexities, along…

Computational Complexity · Computer Science 2025-12-01 Michal Čertík , Andreas Emil Feldmann , Jaroslav Nešetřil , Paweł Rzążewski

Let $A$ and $B$ be finite-dimensional simple algebras with arbitrary signature over an algebraically closed field. Suppose $A$ and $B$ are graded by a semigroup $S$ so that the graded identitical relations of $A$ are the same as those of…

Rings and Algebras · Mathematics 2019-10-07 Yuri Bahturin , Felipe Yasumura

Finite $p$-groups with a unique $\mathcal{A}_2$-subgroup are classified up to isomorphism. A problem proposed by Berkovich and Janko is solved.

Group Theory · Mathematics 2022-03-16 Jixia Gao , Dandan Zhang , Haipeng Qu

Two finite groups are said to have the same order type if for each positive integer $n$ both groups have the same number of elements of order $n$. In 1987 John G. Thompson asked if in this case the solvability of one group implies the…

Group Theory · Mathematics 2024-08-16 Peter Müller

We analyze the classification problem for finitely generated orderable groups from the viewpoint of descriptive set theory. We analyze the standard Borel space of finitely generated left-orderable groups, and the subspace of finitely…

Group Theory · Mathematics 2026-05-11 Filippo Calderoni , Adam Clay

The notion of isomorphism of stable AF-C*-algebras is considered in this paper in the case when the corresponding Bratteli diagram is stationary, i.e., is associated with a single square primitive nonsingular incidence matrix.…

Operator Algebras · Mathematics 2007-05-23 Ola Bratteli , Palle E. T. Jorgensen , Ki Hang Kim , Fred Roush

The basic tool for solving problems in metric geometry and isotonic regression is the metric projection onto closed convex cones. Isotonicity of these projections with respect to a given order relation can facilitate finding the solutions…

Optimization and Control · Mathematics 2016-02-16 A. B. Németh , S. Z. Németh

If $f:[a,b]\to \mathbb{R}$, with $a<b$, is continuous and such that $a$ and $b$ are mapped in opposite directions by $f$, then $f$ has a fixed point in $I$. Suppose that $f:\mathbb{C}\to\mathbb{C}$ is map and $X$ is a continuum. We extend…

General Topology · Mathematics 2016-01-25 Alexander Blokh , Lex Oversteegen

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

In this paper we consider a semitopological $\alpha$-bicyclic monoid $\mathcal{B}_{\alpha}$ and prove that it is algebraically isomorphic to a semigroup of all order isomorphisms between the principal upper sets of the ordinal…

General Topology · Mathematics 2020-08-09 Serhii Bardyla

We are concerned with orderable groups and particularly those with orderings invariant not only under multiplication, but also under a given automorphism or family of automorphisms. Several applications to topology are given: we prove that…

Group Theory · Mathematics 2014-10-01 Dale Rolfsen , Bert Wiest

As part of a general theory for the isomorphism problem for actions of amenable groups, Ornstein and Weiss (J. Anal. Math. 48:1-141,1987) proved that any two Poisson point processes are isomorphic as measure-preserving actions. We give an…

Probability · Mathematics 2019-11-01 Terry Soo , Amanda Wilkens

We show that a finite group $G$ admitting an automorphism $\alpha$ such that the function $G\rightarrow G$, $g\mapsto g\alpha(g)$, is bijective is necessarily solvable.

Group Theory · Mathematics 2019-11-20 Alexander Bors

We investigate the possible structures imposed on a finite group by its possession of an automorphism sending a large fraction of the group elements to their cubes, the philosophy being that this should force the group to be, in some sense,…

Group Theory · Mathematics 2007-10-24 Peter Hegarty

In recent work, Rosenbaum and Wagner showed that isomorphism of explicitly listed $p$-groups of order $n$ could be tested in $n^{\frac{1}{2}\log_p n + O(p)}$ time, roughly a square root of the classical bound. The $O(p)$ term is entirely…

Computational Complexity · Computer Science 2015-11-03 Eugene M. Luks