Related papers: Trivial Isomorphisms between Reduced Products

We prove that every separable tracial von Neumann algebra embeds into a II$_1$ factor with property (T) which can be taken to have trivial outer automorphism and fundamental groups. We also establish an analogous result for the trivial…

The cyclically reduced product of two words $u, v$, denoted $u * v$, is the cyclically reduced form of the concatenation of $u$ by $v$. This product is not associative. Recently S. V. Ivanov has proved that the Andrews-Curtis conjecture can…

We classify minimal complex surfaces of general type with $p_g=q=3$. More precisely, we show that such a surface is either the symmetric product of a curve of genus 3 or a free $\Z_2-$quotient of the product of a curve of genus 2 and a…

Classification, up to isomorphism, of algebras from a non-empty subset of the variety of $n$- dimensional algebras is presented. It is shown that these algebras have only trivial automorphism and if the basic field is algebraically closed…

We classify isotopy classes of automorphisms (self-homeomorphisms) of 3-manifolds satisfying the Thurston Geometrization Conjecture. The classification is similar to the classification of automorphisms of surfaces developed by Nielsen and…

We show that any construction of cup-$i$ products on the normalized chains of simplicial sets is isomorphic -- not just homotopic -- to Steenrod's original construction if it is natural, minimal, non-degenerate, irreducible and free. We use…

We construct natural relative compactifications for the relative Jacobian over a family $X/S$ of reduced curves. In contrast with all the available compactifications so far, ours admit a universal sheaf, after an etale base change. Our…

For a smooth finite cyclic covering over a projective space of dimension greater than one, we show that the group of automorphisms acts faithfully on the cohomology except for a few cases. In characteristic zero, we study the equivariant…

The univalence axiom expresses the principle of extensionality for dependent type theory. However, if we simply add the univalence axiom to type theory, then we lose the property of canonicity - that every closed term computes to a…

The following selection theorem is established:\\ Let $X$ be a compactum possessing a binary normal subbase $\mathcal S$ for its closed subsets. Then every set-valued $\mathcal S$-continuous map $\Phi\colon Z\to X$ with closed $\mathcal…

A coarse description of a subset A of omega is a subset D of omega such that the symmetric difference of A and D has asymptotic density 0. We study the extent to which noncomputable information can be effectively recovered from all coarse…

We extend to arbitrary characteristic some known results about automorphisms of complex Enriques surfaces that act trivially on the cohomology or the cohomology modulo torsion.

Richard P. Stanley defined the chromatic symmetric function of a simple graph and has conjectured that every tree is determined by its chromatic symmetric function. Recently, Takahiro Hasebe and the author proved that the order…

We investigate the size of fixed point sets of automorphisms of bounded domains in $\mathbb{C}^n$. In one complex variable, a nontrivial automorphism has at most two fixed points, but in higher dimensions fixed point sets need not be…

We show that every non-amenable free product of groups admits free ergodic probability measure preserving actions which have relative property (T) in the sense of S.-Popa \cite[Def. 4.1]{Pop06}. There are uncountably many such actions up to…

We produce a sequence of finite dimensional representations of the fundamental group $\pi_1(S)$ of a closed surface where all simple closed curves act with finite order, but where each non--simple closed curve eventually acts with infinite…

We present an elementary proof of the fact that every torsor for an affine group scheme over an algebraically closed field is trivial. This is related to the uniqueness of fibre functors on neutral tannakian categories.

We develop a toolbox for forcing over arbitrary models of set theory without the axiom of choice. In particular, we introduce a variant of the countable chain condition and prove an iteration theorem that applies to many classical forcings…

In many instances in first order logic or computable algebra, classical theorems show that many problems are undecidable for general structures, but become decidable if some rigidity is imposed on the structure. For example, the set of…

Let $\mathbb{Z}$ be the additive group of all integers and $\mathbb{N}$ the sub-monoid of $\mathbb{Z}$ of all non-negative integers. For a finite subset $X$ of $\mathbb{Z}$, we denote by ${\rm max}\ X$ the maximum member in $X$. %Recently,…