scholarly journals Frequent universality criterion and densities

2019 ◽  
pp. 1-23
Author(s):  
R. ERNST ◽  
A. MOUZE
Keyword(s):  
Recent Result ◽  
Hypercyclicity Criterion

We improve a recent result by giving the optimal conclusion both to the frequent universality criterion and the frequent hypercyclicity criterion using the notion of $A$ -densities, where $A$ refers to some weighted densities sharper than the natural lower density. Moreover, we construct an operator which is logarithmically frequently hypercyclic but not frequently hypercyclic.

scholarly journals Additive kinematic formulas for flag area measures

2021 ◽  
Author(s):  
Judit Abardia-Evéquoz ◽  
Andreas Bernig
Keyword(s):  
Recent Result ◽  
Flag Manifold ◽  
Unit Vector ◽  
Algebraic Framework

AbstractWe show the existence of additive kinematic formulas for general flag area measures, which generalizes a recent result by Wannerer. Building on previous work by the second named author, we introduce an algebraic framework to compute these formulas explicitly. This is carried out in detail in the case of the incomplete flag manifold consisting of all $$(p+1)$$ ( p + 1 ) -planes containing a unit vector.

scholarly journals An Exponential Separation Between MA and AM Proofs of Proximity

2021 ◽  
Vol 30 (2) ◽  
Author(s):  
Tom Gur ◽  
Yang P. Liu ◽  
Ron D. Rothblum
Keyword(s):  
Quantum Information ◽  
Lower Bound ◽  
Recent Result ◽  
Query Complexity ◽  
Random String ◽  
Natural Property ◽  
Public And Private ◽  
Alternate Proof ◽  
Interactive Proofs ◽  
Exponential Separation

AbstractInteractive proofs of proximity allow a sublinear-time verifier to check that a given input is close to the language, using a small amount of communication with a powerful (but untrusted) prover. In this work, we consider two natural minimally interactive variants of such proofs systems, in which the prover only sends a single message, referred to as the proof. The first variant, known as -proofs of Proximity (), is fully non-interactive, meaning that the proof is a function of the input only. The second variant, known as -proofs of Proximity (), allows the proof to additionally depend on the verifier's (entire) random string. The complexity of both s and s is the total number of bits that the verifier observes—namely, the sum of the proof length and query complexity. Our main result is an exponential separation between the power of s and s. Specifically, we exhibit an explicit and natural property $$\Pi$$ Π that admits an with complexity $$O(\log n)$$ O ( log n ) , whereas any for $$\Pi$$ Π has complexity $$\tilde{\Omega}(n^{1/4})$$ Ω ~ ( n 1 / 4 ) , where n denotes the length of the input in bits. Our lower bound also yields an alternate proof, which is more general and arguably much simpler, for a recent result of Fischer et al. (ITCS, 2014). Also, Aaronson (Quantum Information & Computation 2012) has shown a $$\Omega(n^{1/6})$$ Ω ( n 1 / 6 ) lower bound for the same property $$\Pi$$ Π .Lastly, we also consider the notion of oblivious proofs of proximity, in which the verifier's queries are oblivious to the proof. In this setting, we show that s can only be quadratically stronger than s. As an application of this result, we show an exponential separation between the power of public and private coin for oblivious interactive proofs of proximity.

scholarly journals A note on magnitude bounds for the mask coefficients of the interpolatory Dubuc–Deslauriers subdivision scheme

2014 ◽  
Vol 17 (1) ◽  
pp. 226-232
Author(s):  
H. E. Bez ◽  
N. Bez
Keyword(s):  
Recent Result ◽  
Operator Norm ◽  
Subdivision Scheme ◽  
Sharp Bounds

AbstractWe analyse the mask associated with the $2n$-point interpolatory Dubuc–Deslauriers subdivision scheme $S_{a^{[n]}}$. Sharp bounds are presented for the magnitude of the coefficients $a^{[n]}_{2i-1}$ of the mask. For scales $i \in [1,\sqrt{n}]$ it is shown that $|a^{[n]}_{2i-1}|$ is comparable to $i^{-1}$, and for larger power scales, exponentially decaying bounds are obtained. Using our bounds, we may precisely analyse the summability of the mask as a function of $n$ by identifying which coefficients of the mask contribute to the essential behaviour in $n$, recovering and refining the recent result of Deng–Hormann–Zhang that the operator norm of $S_{a^{[n]}}$ on $\ell ^\infty $ grows logarithmically in $n$.

scholarly journals On hypercyclicity and supercyclicity criteria

2004 ◽  
Vol 70 (1) ◽  
pp. 45-54 ◽  
Author(s):  
Teresa Bermúdez ◽  
Antonio Bonilla ◽  
Alfredo Peris
Keyword(s):  
Wide Class ◽  
Hypercyclic Operators ◽  
Dense Range ◽  
Hypercyclicity Criterion ◽  
Supercyclicity Criterion

We show that the Hypercyclicity Criterion coincides with other existing hypercyclicity criteria and prove that a wide class of hypercyclic operators satisfy the Criterion. The results obtained extend or improve earlier work of several authors. We also unify the different versions of the Supercyclicity Criterion and show that operators with dense generalised kernel and dense range are supercyclic.

scholarly journals Uniqueness of the maximal ideal of operators on the ℓp-sum of ℓ∞n (n ∈ ) for 1 < p < ∞

2016 ◽  
Vol 160 (3) ◽  
pp. 413-421 ◽  
Author(s):  
TOMASZ KANIA ◽  
NIELS JAKOB LAUSTSEN
Keyword(s):  
Banach Space ◽  
Recent Result ◽  
Banach Algebra ◽  
Banach Spaces ◽  
Maximal Ideal ◽  
American Mathematical Society ◽  
Linear Operators ◽  
Bounded Linear Operators ◽  
Bounded Linear ◽  
Unique Maximal Ideal

AbstractA recent result of Leung (Proceedings of the American Mathematical Society, 2015) states that the Banach algebra ℬ(X) of bounded, linear operators on the Banach space X = (⊕n∈$\mathbb{N}$ ℓ∞n)ℓ1 contains a unique maximal ideal. We show that the same conclusion holds true for the Banach spaces X = (⊕n∈$\mathbb{N}$ ℓ∞n)ℓp and X = (⊕n∈$\mathbb{N}$ ℓ1n)ℓp whenever p ∈ (1, ∞).

Convergence of successive approximations to a stochastic fixed point

1980 ◽  
Vol 17 (1) ◽  
pp. 297-299
Author(s):  
Arun P. Sanghvi
Keyword(s):  
Fixed Point ◽  
Recent Result ◽  
Metric Space ◽  
Sufficient Conditions ◽  
Successive Approximations ◽  
Compact Metric Space

This paper describes some sufficient conditions that ensure the convergence of successive random applications of a family of mappings {Γα : α ∈ A} on a compact metric space (X, d) to a stochastic fixed point. The results are similar in spirit to a recent result of Yahav (1975).

Additive Maps on Units of Rings

2018 ◽  
Vol 61 (1) ◽  
pp. 130-141
Author(s):  
Tamer Košan ◽  
Serap Sahinkaya ◽  
Yiqiang Zhou
Keyword(s):  
Recent Result ◽  
Direct Product ◽  
Homomorphic Image ◽  
Semilocal Ring ◽  
Additive Map ◽  
Exchange Rings ◽  
Additive Maps

AbstractLet R be a ring. A map f: R → R is additive if f(a + b) = f(a) + f(b) for all elements a and b of R. Here, a map f: R → R is called unit-additive if f(u + v) = f(u) + f(v) for all units u and v of R. Motivated by a recent result of Xu, Pei and Yi showing that, for any field F, every unit-additive map of (F) is additive for all n ≥ z, this paper is about the question of when every unit-additivemap of a ring is additive. It is proved that every unit-additivemap of a semilocal ring R is additive if and only if either R has no homomorphic image isomorphic to or R/J(R) ≅ with 2 = 0 in R. Consequently, for any semilocal ring R, every unit-additive map of (R) is additive for all n ≥ 2. These results are further extended to rings R such that R/J(R) is a direct product of exchange rings with primitive factors Artinian. A unit-additive map f of a ring R is called unithomomorphic if f(uv) = f(u)f(v) for all units u, v of R. As an application, the question of when every unit-homomorphic map of a ring is an endomorphism is addressed.

Sign in / Sign up

Export Citation Format

Share Document