Motivated by Candes and Donoho′s work (Candés, E J, Donoho, D L, Recovering edges in ill-posed inverse problems: optimality of curvelet frames. Ann. Stat. 30, 784-842 (2002)), this paper is devoted to giving a lower bound of minimax mean square errors for Riesz fractional integration transforms and Bessel transforms.

We propose a nonparametric estimator of the expected discounted penalty function in compound Poisson risk model. use projection on Laguerre basis and we compute coefficients using Plancherel theorem. provide an upper bound MISE our estimator, show it achieves parametric rates convergence Sobolev–Laguerre spaces without needing bias-variance compromise. Moreover, compare with deconvolution metho...

We define non-commutative versions of the vertex packing polytope, theta convex body and fractional polytope a graph, establish quantum version Sandwich Theorem Grötschel, Lovász Schrijver (1986) [7]. new number graph which lead to an upper bound zero-error capacity corresponding channel that can be genuinely better than one established by Duan, Severini Winter (2013) [5]. counterparts widely u...

We give a new proof, independent of Lin's theorem, the Segal conjecture for cyclic group order two. The key input is calculation, as Hopf algebroid, Real topological Hochschild homology F2. This determines E2-page descent spectral sequence map NF2?F2, where NF2 C2-equivariant Hill–Hopkins–Ravenel norm represents upper bound on RO(C2)-graded homotopy NF2, from which an immediate corollary.

In this paper, we consider maximal and irreducible quartic orders which arise from integral binary forms, via the construction of Birch Merriman, whose field fractions is a D 4 <mml:annotation encoding=...

We show that a miniaturised version of Maclagan’s theorem on monomial ideals is equivalent to 1−Con(IΣ2) and classify a phase transition threshold for this theorem. This work highlights the combinatorial nature of Maclagan’s theorem. Monomial ideals play an important role in commutative algebra and algebraic combinatorics. Maclagan’s theorem has several applications in computer algebra (See, fo...

This paper devotes to the adaptive globally synchronization within predefined-time of two time-delayed fractional-order chaotic systems. Firstly, through fractional calculus, novel different systems with time-delay are proposed, whose convergence is guaranteed and phase trajectory given. Secondly, by exploiting non-negative Lyapunov function inequality theorem, a global stability theorem which ...

Let $G$ be a finite and simple graph with edge set $E(G)$. The second geometric-arithmetic index is defined as $GA_2(G)=sum_{uvin E(G)}frac{2sqrt{n_un_v}}{n_u+n_v}$, where $n_u$ denotes the number of vertices in $G$ lying closer to $u$ than to $v$. In this paper we find a sharp upper bound for $GA_2(T)$, where $T$ is tree, in terms of the order and maximum degree o...

In supersymmetric models the lightest Higgs boson may decay with a sizable branching ratio into a pair of light neutralinos. We analyze such decays within the context of the minimal supersymmetric standard model with R-parity violation, where the neutralino itself is unstable and decays into Standard Model fermions. We show that the R-parity violating couplings induce novel Higgs decay signals ...

We study the Excluded Grid Theorem of Robertson and Seymour. This is a fundamental result in graph theory, that states that there is some function f : Z → Z, such that for all integers g > 0, every graph of treewidth at least f(g) contains the (g×g)-grid as a minor. Until recently, the best known upper bounds on f were super-exponential in g. A recent work of Chekuri and Chuzhoy provided the fi...