Search results for "Theory"

showing 10 items of 24627 documents

ORBITALLY NONEXPANSIVE MAPPINGS

2015

We define a class of nonlinear mappings which is properly larger than the class of nonexpansive mappings. We also give a fixed point theorem for this new class of mappings.

010101 applied mathematicsNew classDiscrete mathematicsClass (set theory)Nonlinear systemGeneral Mathematics010102 general mathematicsFixed-point theorem0101 mathematicsFixed point01 natural sciencesMathematicsBulletin of the Australian Mathematical Society
researchProduct

On the local negativity of surfaces with numerically trivial canonical class

2018

010101 applied mathematicsPure mathematicsClass (set theory)General Mathematics010102 general mathematicsNegativity effect0101 mathematics01 natural sciencesMathematicsRendiconti Lincei - Matematica e Applicazioni
researchProduct

Defect zero characters predicted by local structure

2017

Let $G$ be a finite group and let $p$ be a prime. Assume that there exists a prime $q$ dividing $|G|$ which does not divide the order of any $p$-local subgroup of $G$. If $G$ is $p$-solvable or $q$ divides $p-1$, then $G$ has a $p$-block of defect zero. The case $q=2$ is a well-known result by Brauer and Fowler.

010101 applied mathematicsPure mathematicsFinite groupGeneral Mathematics010102 general mathematicsZero (complex analysis)Order (group theory)0101 mathematics01 natural sciencesLocal structurePrime (order theory)MathematicsBulletin of the London Mathematical Society
researchProduct

Jakimovski–Leviatan operators of Kantorovich type involving multiple Appell polynomials

2019

Abstract The purpose of the present paper is to obtain the degree of approximation in terms of a Lipschitz type maximal function for the Kantorovich type modification of Jakimovski–Leviatan operators based on multiple Appell polynomials. Also, we study the rate of approximation of these operators in a weighted space of polynomial growth and for functions having a derivative of bounded variation. A Voronvskaja type theorem is obtained. Further, we illustrate the convergence of these operators for certain functions through tables and figures using the Maple algorithm and, by a numerical example, we show that our Kantorovich type operator involving multiple Appell polynomials yields a better r…

010101 applied mathematicsPure mathematicsGeneral Mathematics010102 general mathematics0101 mathematicsType (model theory)01 natural sciencesMathematicsGeorgian Mathematical Journal
researchProduct

The uniform convergence of a double sequence of functions at a point and Korovkin-type approximation theorems

2020

Abstract In this paper, we introduce an interesting kind of convergence for a double sequence called the uniform convergence at a point. We give an example and demonstrate a Korovkin-type approximation theorem for a double sequence of functions using the uniform convergence at a point. Then we show that our result is stronger than the Korovkin theorem given by Volkov and present several graphs. Finally, in the last section, we compute the rate of convergence.

010101 applied mathematicsPure mathematicsGeneral MathematicsUniform convergence010102 general mathematicsPoint (geometry)0101 mathematicsType (model theory)01 natural sciencesDouble sequenceMathematicsGeorgian Mathematical Journal
researchProduct

Efficient generation of restricted growth words

2013

A length n restricted growth word is a word w=w"1w"2...w"n over the set of integers where w"1=0 and each w"i, i>1, lies between 0 and the value of a word statistics of the prefix w"1w"2...w"i"-"1 of w, plus one. Restricted growth words simultaneously generalize combinatorial objects as restricted growth functions, staircase words and ascent or binary sequences. Here we give a generic generating algorithm for restricted growth words. It produces a Gray code and runs in constant average time provided that the corresponding statistics has some local properties.

010102 general mathematicsBinary numberValue (computer science)0102 computer and information sciences[ MATH.MATH-CO ] Mathematics [math]/Combinatorics [math.CO]01 natural sciencesComputer Science ApplicationsTheoretical Computer SciencePrefixCombinatoricsGray code010201 computation theory & mathematics[MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]Signal ProcessingPartial word0101 mathematicsConstant (mathematics)ComputingMilieux_MISCELLANEOUSWord (group theory)Information SystemsMathematicsInformation Processing Letters
researchProduct

Constant sign and nodal solutions for nonlinear robin equations with locally defined source term

2020

We consider a parametric Robin problem driven by a nonlinear, nonhomogeneous differential operator which includes as special cases the p-Laplacian and the (p,q)-Laplacian. The source term is parametric and only locally defined (that is, in a neighborhood of zero). Using suitable cut-off techniques together with variational tools and comparison principles, we show that for all big values of the parameter, the problem has at least three nontrivial smooth solutions, all with sign information (positive, negative and nodal).

010102 general mathematicsMathematical analysisMathematics::Spectral Theory01 natural sciencesLocally defined reactionTerm (time)Critical groups010101 applied mathematicsNonlinear systemConstant sign and nodal solutionsSettore MAT/05 - Analisi MatematicaModeling and SimulationQA1-9390101 mathematicsNonlinear maximum principleConstant (mathematics)NODALMathematicsAnalysisSign (mathematics)MathematicsNonlinear regularity
researchProduct

Vertical versus horizontal Sobolev spaces

2020

Let $\alpha \geq 0$, $1 < p < \infty$, and let $\mathbb{H}^{n}$ be the Heisenberg group. Folland in 1975 showed that if $f \colon \mathbb{H}^{n} \to \mathbb{R}$ is a function in the horizontal Sobolev space $S^{p}_{2\alpha}(\mathbb{H}^{n})$, then $\varphi f$ belongs to the Euclidean Sobolev space $S^{p}_{\alpha}(\mathbb{R}^{2n + 1})$ for any test function $\varphi$. In short, $S^{p}_{2\alpha}(\mathbb{H}^{n}) \subset S^{p}_{\alpha,\mathrm{loc}}(\mathbb{R}^{2n + 1})$. We show that the localisation can be omitted if one only cares for Sobolev regularity in the vertical direction: the horizontal Sobolev space $S_{2\alpha}^{p}(\mathbb{H}^{n})$ is continuously contained in the vertical Sobolev sp…

010102 general mathematicsMetric Geometry (math.MG)Function (mathematics)Lipschitz continuity01 natural sciencesFunctional Analysis (math.FA)Fractional calculusSobolev spaceCombinatoricsMathematics - Functional AnalysisMathematics - Metric GeometryMathematics - Classical Analysis and ODEsBounded function0103 physical sciencesVertical directionClassical Analysis and ODEs (math.CA)FOS: MathematicsHeisenberg groupOrder (group theory)010307 mathematical physics0101 mathematics46E35 (Primary) 26A33 35R03 43A15 (Secondary)AnalysisMathematics
researchProduct

Random Tensor Theory: Extending Random Matrix Theory to Mixtures of Random Product States

2012

We consider a problem in random matrix theory that is inspired by quantum information theory: determining the largest eigenvalue of a sum of p random product states in $${(\mathbb {C}^d)^{\otimes k}}$$ , where k and p/d k are fixed while d → ∞. When k = 1, the Marcenko-Pastur law determines (up to small corrections) not only the largest eigenvalue ( $${(1+\sqrt{p/d^k})^2}$$ ) but the smallest eigenvalue $${(\min(0,1-\sqrt{p/d^k})^2)}$$ and the spectral density in between. We use the method of moments to show that for k > 1 the largest eigenvalue is still approximately $${(1+\sqrt{p/d^k})^2}$$ and the spectral density approaches that of the Marcenko-Pastur law, generalizing the random matrix…

010102 general mathematicsSpectral densityStatistical and Nonlinear PhysicsMethod of moments (probability theory)01 natural sciencesCombinatorics010104 statistics & probabilitysymbols.namesakeDistribution (mathematics)Product (mathematics)Gaussian integralsymbolsTensor0101 mathematicsRandom matrixMathematical PhysicsEigenvalues and eigenvectorsMathematicsCommunications in Mathematical Physics
researchProduct

Adjacency matrices of random digraphs: singularity and anti-concentration

2017

Let ${\mathcal D}_{n,d}$ be the set of all $d$-regular directed graphs on $n$ vertices. Let $G$ be a graph chosen uniformly at random from ${\mathcal D}_{n,d}$ and $M$ be its adjacency matrix. We show that $M$ is invertible with probability at least $1-C\ln^{3} d/\sqrt{d}$ for $C\leq d\leq cn/\ln^2 n$, where $c, C$ are positive absolute constants. To this end, we establish a few properties of $d$-regular directed graphs. One of them, a Littlewood-Offord type anti-concentration property, is of independent interest. Let $J$ be a subset of vertices of $G$ with $|J|\approx n/d$. Let $\delta_i$ be the indicator of the event that the vertex $i$ is connected to $J$ and define $\delta = (\delta_1, …

0102 computer and information sciences01 natural scienceslittlewood–offord theory60C05 60B20 05C80 15B52 46B06law.inventionCombinatoricsSingularityanti-concentrationlawFOS: MathematicsMathematics - CombinatoricsAdjacency matrix0101 mathematicsMathematicsinvertibility of random matricesApplied Mathematics010102 general mathematicsProbability (math.PR)random regular graphsDirected graphsingular probabilityGraphVertex (geometry)Invertible matrix010201 computation theory & mathematicsadjacency matricesCombinatorics (math.CO)Mathematics - ProbabilityAnalysis
researchProduct