English
Related papers

Related papers: Partially Bounded Transformations have Trivial Cen…

200 papers

We study finite transitive permutation groups $G\leqslant\operatorname{Sym}(\Omega)$ such that all orbits of the conjugation action on $G$ of the normaliser of $G$ in $\operatorname{Sym}(\Omega)$ have size bounded by some constant. Our…

Group Theory · Mathematics 2020-04-08 Alexander Bors , Michael Giudici

We discuss some categorical aspects of the objects that appear in the construction of the Monster and other sporadic simple groups. We define the basic representation of the categorical torus $\mathcal T$ classified by an even symmetric…

Group Theory · Mathematics 2024-05-28 Nora Ganter

Transformations involving only local operations assisted with classical communication are investigated for multipartite entangled pure states having tensor rank 2. All necessary and sufficient conditions for the possibility of…

Quantum Physics · Physics 2010-01-22 S. Turgut , Y. Gul , N. K. Pak

We complete the $L^p$ boundedness theory of commutators of Hilbert transforms along monomial curves by providing the previously missing lower bounds. This optimal result now covers all monomial curves while previous results had significant…

Classical Analysis and ODEs · Mathematics 2024-03-14 Kangwei Li , Henri Martikainen , Tuomas Oikari

We define a model for rank one measure preserving transformations in the sense of [2]. This is done by defining a new Polish topology on the space of codes, which are infinite rank one words, for symbolic rank one systems. We establish that…

Dynamical Systems · Mathematics 2013-08-14 Su Gao , Aaron Hill

Many fundamental and key objects in quantum mechanics are linear mappings between particular affine/linear spaces. This structure includes basic quantum elements such as states, measurements, channels, instruments, non-signalling channels…

Quantum Physics · Physics 2024-07-19 Simon Milz , Marco Túlio Quintino

One measure of the complexity of a first-order theory, and similarly a type, is the complexity of the formulas required to axiomatize it. We say a theory is bounded if there is an axiomatization involving only $\forall_n$-formulas for some…

Logic · Mathematics 2026-04-29 Hongyu Zhu

We give an exact spectral equivalence between the quantum group invariant XXZ chain with arbitrary left boundary term and the same XXZ chain with purely diagonal boundary terms. This equivalence, and a further one with a link pattern…

Statistical Mechanics · Physics 2011-02-16 A. Nichols , V. Rittenberg , J. de Gier

We study the properties of the set where a generalized function of bounded variation has infinite approximate limit, highlighting in this way the main geometric difference with functions of bounded variation. To this aim we prove a new…

Analysis of PDEs · Mathematics 2024-02-21 Alessandro Cucinotta

We prove that a rank one transformation satisfying a condition called restricted growth is a mixing transformation if and only if the spacer sequence for the transformation is uniformly ergodic. Uniform ergodicity is a generalization of the…

Dynamical Systems · Mathematics 2007-05-23 Darren Creutz , C. E. Silva

In [9] a question is raised: if a power bounded operator is quasisimilar to a singular unitary operator, is it similar to this unitary operator? For polynomially bounded operators, a positive answer to this question is known [1], [13]. In…

Functional Analysis · Mathematics 2018-04-13 Maria F. Gamal'

In this paper, we investigate a class of non-invertible piecewise isometries on the upper half-plane known as Translated Cone Exchanges. These maps include a simple interval exchange on a boundary we call the baseline. We provide a…

Dynamical Systems · Mathematics 2024-07-08 Noah Cockram , Peter Ashwin , Ana Rodrigues

A commutative ring is reduced when it can be embedded into a direct product of fields. While the category of reduced commutative rings plays a fundamental role in affine geometry, it exhibits several structural deficiencies: it admits…

Rings and Algebras · Mathematics 2026-05-14 Luca Carai , Miriam Kurtzhals , Tommaso Moraschini

We compute the limit distribution of partial transposes (when both the number and the size of blocks tends to infinity) for a large class of ensembles of unitarily invariant random matrices. Furthermore, it is shown the asymptotic freeness…

Probability · Mathematics 2024-05-28 James A. Mingo , Mihai Popa

In this paper, we characterize the monoid of endomorphisms of the semigroup of all oriented full transformations of a finite chain, as well as the monoid of endomorphisms of the semigroup of all oriented partial transformations and the…

Rings and Algebras · Mathematics 2022-07-27 De Biao Li , Vítor H. Fernandes

We introduce the notion of radical preservation and prove that a radical-preserving homomorphism of left artinian rings of finite projective dimension with superfluous kernel reflects the finiteness of the little finitistic, big finitistic…

Representation Theory · Mathematics 2025-08-01 Odysseas Giatagantzidis

Let $X$ be a complex projective bundle. We prove that $X$ admits an endomorphism of degree $>1$ and commuting with the projection to the base, if and only if $X$ trivializes after a finite covering. When $X$ is the projectivization of a…

Algebraic Geometry · Mathematics 2007-05-23 Ekaterina Amerik

We compute some dependence coefficients for the stationary Markov chain whose transition kernel is the Perron-Frobenius operator of an expanding map $T$ of $[0, 1]$ with a neutral fixed point. We use these coefficients to prove a central…

Probability · Mathematics 2008-02-11 J. Dedecker , C. Prieur

A linear group G on a finite vector space V, (that is, a subgroup of GL(V)) is called (1/2)-transitive if all the G-orbits on the set of nonzero vectors have the same size. We complete the classification of all the (1/2)-transitive linear…

Group Theory · Mathematics 2014-12-15 Martin W. Liebeck , Cheryl E. Praeger , Jan Saxl

Current discrete randomness and information conservation inequalities are over total recursive functions, i.e. restricted to deterministic processing. This restriction implies that an algorithm can break algorithmic randomness conservation…

Computational Complexity · Computer Science 2013-10-15 Samuel Epstein