English
Related papers

Related papers: A weak dichotomy below E_1 \times E_3

200 papers

In [arXiv:1006.4939] the enumeration order reducibility is defined on natural numbers. For a c.e. set A, [A] denoted the class of all subsets of natural numbers which are co-order with A. In definition 5 we redefine co-ordering for rational…

Logic in Computer Science · Computer Science 2011-02-15 Saeed Asaeedi , Farzad Didehvar

A weakly distance-regular digraph is 3-equivalenced if its attached association scheme is 3-equivalenced. In this paper, we classify the family of such digraphs under the assumption of the commutativity.

Combinatorics · Mathematics 2017-08-01 Yuefeng Yang , Benjian Lv , Kaishun Wang

Let $\rho_\ell$ be a semisimple $\ell$-adic representation of a number field $K$ that is unramified almost everywhere. We introduce a new notion called weak abelian direct summands of $\rho_\ell$ and completely characterize them, for…

Number Theory · Mathematics 2024-05-29 Gebhard Böckle , Chun-Yin Hui

A relational structure is called reversible iff every bijective endomorphism of that structure is an automorphism. We give several equivalents of that property in the class of disconnected binary structures and some its subclasses. For…

Logic · Mathematics 2017-11-07 Miloš S. Kurilić , Nenad Morača

We construct a `weak' version EM^w(K) of Lack & Street's 2-category of monads in a 2-category K, by replacing their compatibility constraint of 1-cells with the units of monads by an additional condition on the 2-cells. A relation between…

Category Theory · Mathematics 2012-01-27 Gabriella Böhm

Given an L_{\omega_1 \omega}-elementary class C, that is the collection of the countable models of some L_{\omega_1 \omega}-sentence, denote by \cong_C and \equiv_C the analytic equivalence relations of, respectively, isomorphism and…

Logic · Mathematics 2011-12-05 Luca Motto Ros

Strong bisimulation for labelled transition systems is one of the most fundamental equivalences in process algebra, and has been generalised to numerous classes of systems that exhibit richer transition behaviour. Nearly all of the ensuing…

Logic in Computer Science · Computer Science 2014-05-05 Sergey Goncharov , Dirk Pattinson

We define when a noetherian ring R is called a right ( or a left) weakly krull symmetric ring . We then prove that if R is a right ( or a left ) krull homogenous ring then R is a right ( or a left ) weakly krull symmetric ring . This result…

Rings and Algebras · Mathematics 2016-04-05 C. L. Wangneo

We develop new tools to analyze the complexity of the conjugacy equivalence relation $E_\mathsf{lo}(G)$, whenever $G$ is a left-orderable group. Our methods are used to demonstrate non-smoothness of $E_\mathsf{lo}(G)$ for certain groups $G$…

Logic · Mathematics 2024-10-01 Filippo Calderoni , Adam Clay

In order to prove weak convergence of the periodic multiplicative Selmer algorithm we ensure that the periodicity matrix is positive and establish a relation between its entries and eigenvalues. Since we can imply that the limit of these…

Number Theory · Mathematics 2025-11-18 J. Christopher Kops

We study the accessibility properties of trivial cofibrations and weak equivalences in a combinatorial model category and prove an estimate for the accessibility rank of weak equivalences. In particular, we show that the class of weak…

Algebraic Topology · Mathematics 2015-05-13 G. Raptis , J. Rosický

A (vector space) basis B of a Lie algebra is said to be very nilpotent if all the iterated brackets of elements of B are nilpotent. In this note, we prove a refinement of Engel's Theorem. We show that a Lie algebra has a very nilpotent…

Representation Theory · Mathematics 2010-11-24 Bulois Michael

If $X$ is a set, $E$ is an equivalence relation on $X$, and $n \in \omega$, then define $$[X]^n_E = \{(x_0, ..., x_{n - 1}) \in {}^nX : (\forall i,j)(i \neq j \Rightarrow \neg(x_i \ E \ x_j))\}.$$ For $n \in \omega$, a set $X$ has the…

Logic · Mathematics 2017-09-15 William Chan , Connor Meehan

For any abelian group $A$, we prove an asymptotic formula for the number of $A$-extensions $K/\mathbb{Q}$ of bounded discriminant such that the associated norm one torus $R_{K/\mathbb{Q}}^1 \mathbb{G}_m$ satisfies weak approximation. We are…

Number Theory · Mathematics 2023-12-22 Peter Koymans , Nick Rome

In this paper we study the descriptive complexity of the topological orbit equvalence relation for some Borel classes of Cantor minimal systems. Specifically, we study the Borel class of all Cantor minimal systems with only finitely many…

Dynamical Systems · Mathematics 2026-01-05 Su Gao , Ruiwen Li , Yiming Sun

We prove that the automorphisms of any separable C*-algebra that does not have continuous trace are not classifiable by countable structures up to unitary equivalence. This implies a dichotomy for the Borel complexity of the relation of…

Operator Algebras · Mathematics 2016-05-06 Martino Lupini

Let $\mathbb{F}$ be an algebraically closed field of characteristic $p>3$, and $\ggg$ the $p$-dimensional Witt algebra over $\mathbb{F}$. Let $\N$ be the nilpotent cone of $\ggg$. Explicit description of $\N$ is given, so that the conjugacy…

Representation Theory · Mathematics 2012-12-19 Yu-Feng Yao , Hao Chang

The converse of the Borel-Cantelli Lemma states that if $\{A_i\}_{i=1}^\infty$ is a sequence of independent events such that $\sum P(A_i)=\infty$, then almost surely infinitely many of these events will occur. Erd\H os and R\'enyi proved…

Probability · Mathematics 2021-08-11 Csaba Biró , Israel R. Curbelo

Let $S$ be an inverse semigroup with the set of idempotents $E$. We prove that the semigroup algebra $\ell^{1}(S)$ is always $2n$-weakly module amenable as an $\ell^{1}(E)$-module, for any $n\in \mathbb{N}$, where $E$ acts on $S$ trivially…

Functional Analysis · Mathematics 2020-01-27 Hoger Ghahramani

We say that an infinite word w is weak abelian periodic if it can be factorized into finite words with the same frequencies of letters. In the paper we study properties of weak abelian periodicity, its relations with balance and frequency.…

Combinatorics · Mathematics 2013-02-19 Sergey Avgustinovich , Svetlana Puzynina
‹ Prev 1 4 5 6 7 8 10 Next ›