Search results for "C15"

showing 10 items of 66 documents

Partially hyperbolic diffeomorphisms with a uniformly compact center foliation: the quotient dynamics

2016

We show that a partially hyperbolic$C^{1}$-diffeomorphism$f:M\rightarrow M$with a uniformly compact$f$-invariant center foliation${\mathcal{F}}^{c}$is dynamically coherent. Further, the induced homeomorphism$F:M/{\mathcal{F}}^{c}\rightarrow M/{\mathcal{F}}^{c}$on the quotient space of the center foliation has the shadowing property, i.e. for every${\it\epsilon}>0$there exists${\it\delta}>0$such that every${\it\delta}$-pseudo-orbit of center leaves is${\it\epsilon}$-shadowed by an orbit of center leaves. Although the shadowing orbit is not necessarily unique, we prove the density of periodic center leaves inside the chain recurrent set of the quotient dynamics. Other interesting proper…

010101 applied mathematicsPure mathematicsMSC: 37D30 37C15Applied MathematicsGeneral Mathematics010102 general mathematics[MATH.MATH-DS]Mathematics [math]/Dynamical Systems [math.DS][ MATH.MATH-DS ] Mathematics [math]/Dynamical Systems [math.DS]0101 mathematics01 natural sciencesQuotientMathematics
researchProduct

Packing colorings of subcubic outerplanar graphs

2018

Given a graph $G$ and a nondecreasing sequence $S=(s_1,\ldots,s_k)$ of positive integers, the mapping $c:V(G)\longrightarrow \{1,\ldots,k\}$ is called an $S$-packing coloring of $G$ if for any two distinct vertices $x$ and $y$ in $c^{-1}(i)$, the distance between $x$ and $y$ is greater than $s_i$. The smallest integer $k$ such that there exists a $(1,2,\ldots,k)$-packing coloring of a graph $G$ is called the packing chromatic number of $G$, denoted $\chi_{\rho}(G)$. The question of boundedness of the packing chromatic number in the class of subcubic (planar) graphs was investigated in several earlier papers; recently it was established that the invariant is unbounded in the class of all sub…

05C15 05C12 05C70Applied MathematicsGeneral Mathematics010102 general mathematics010103 numerical & computational mathematics[INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]01 natural sciencesGraph[MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO]Combinatorics[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]IntegerOuterplanar graphBounded function[MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]FOS: MathematicsBipartite graphMathematics - CombinatoricsDiscrete Mathematics and CombinatoricsCombinatorics (math.CO)0101 mathematicsInvariant (mathematics)ComputingMilieux_MISCELLANEOUSMathematicsAequationes mathematicae
researchProduct

Brauer correspondent blocks with one simple module

2019

One of the main problems in representation theory is to understand the exact relationship between Brauer corresponding blocks of finite groups. The case where the local correspondent has a unique simple module seems key. We characterize this situation for the principal p-blocks where p is odd.

20C20 20C15MatemáticasApplied MathematicsGeneral Mathematics010102 general mathematicsPrincipal (computer security)MathematicsofComputing_GENERAL01 natural sciencesRepresentation theoryAlgebra0103 physical sciencesKey (cryptography)FOS: Mathematics010307 mathematical physics0101 mathematicsRepresentation Theory (math.RT)Simple moduleMathematics - Representation TheoryMathematics
researchProduct

The average element order and the number of conjugacy classes of finite groups

2021

Abstract Let o ( G ) be the average order of the elements of G, where G is a finite group. We show that there is no polynomial lower bound for o ( G ) in terms of o ( N ) , where N ⊴ G , even when G is a prime-power order group and N is abelian. This gives a negative answer to a question of A. Jaikin-Zapirain.

20D15 20C15 20E45Finite groupPolynomialAlgebra and Number TheoryGroup (mathematics)010102 general mathematicsGroup Theory (math.GR)01 natural sciencesUpper and lower boundsElement OrderCombinatoricsConjugacy class0103 physical sciencesFOS: MathematicsOrder (group theory)010307 mathematical physics0101 mathematicsAbelian groupMathematics - Group TheoryG110 Pure MathematicsMathematics
researchProduct

Sharp capacity estimates for annuli in weighted R^n and in metric spaces

2017

We obtain estimates for the nonlinear variational capacity of annuli in weighted R^n and in metric spaces. We introduce four different (pointwise) exponent sets, show that they all play fundamental roles for capacity estimates, and also demonstrate that whether an end point of an exponent set is attained or not is important. As a consequence of our estimates we obtain, for instance, criteria for points to have zero (resp. positive) capacity. Our discussion holds in rather general metric spaces, including Carnot groups and many manifolds, but it is just as relevant on weighted R^n. Indeed, to illustrate the sharpness of our estimates, we give several examples of radially weighted R^n, which …

31C45 (Primary) 30C65 30L99 31B15 31C15 31E0 (Secondary)annulusmetric spacequasiconformal mappingMathematical Analysisexponent setsp-admissible weightSobolev spaceradial weightMathematics - Analysis of PDEsAnnulus; Doubling measure; Exponent sets; Metric space; Newtonian space; p-admissible weight; Poincare inequality; Quasiconformal mapping; Radial weight; Sobolev space; Variational capacityMatematisk analysPoincaré inequalitydoubling measureFOS: MathematicsNewtonian spacevariational capacityAnalysis of PDEs (math.AP)
researchProduct

Frame-related Sequences in Chains and Scales of Hilbert Spaces

2022

Frames for Hilbert spaces are interesting for mathematicians but also important for applications in, e.g., signal analysis and physics. In both mathematics and physics, it is natural to consider a full scale of spaces, and not only a single one. In this paper, we study how certain frame-related properties of a certain sequence in one of the spaces, such as completeness or the property of being a (semi-) frame, propagate to the other ones in a scale of Hilbert spaces. We link that to the properties of the respective frame-related operators, such as analysis or synthesis. We start with a detailed survey of the theory of Hilbert chains. Using a canonical isomorphism, the properties of frame se…

42C15 46C99 47A70Algebra and Number TheoryHilbert chainsLogicFunctional Analysis (math.FA)Mathematics - Functional AnalysisSettore MAT/05 - Analisi Matematicaframes; scales of Hilbert spaces; Hilbert chains; Bessel sequences; semi-framesframesFOS: Mathematicsscales of Hilbert spacessemi-framesGeometry and TopologyBessel sequencesMathematical PhysicsAnalysis
researchProduct

Frames and weak frames for unbounded operators

2020

In 2012 G\u{a}vru\c{t}a introduced the notions of $K$-frame and of atomic system for a linear bounded operator $K$ in a Hilbert space $\mathcal{H}$, in order to decompose its range $\mathcal{R}(K)$ with a frame-like expansion. In this article we revisit these concepts for an unbounded and densely defined operator $A:\mathcal{D}(A)\to\mathcal{H}$ in two different ways. In one case we consider a non-Bessel sequence where the coefficient sequence depends continuously on $f\in\mathcal{D}(A)$ with respect to the norm of $\mathcal{H}$. In the other case we consider a Bessel sequence and the coefficient sequence depends continuously on $f\in\mathcal{D}(A)$ with respect to the graph norm of $A$.

42C15 47A05 47A63 41A65Atomic systemDensely defined operatorAtomic system010103 numerical & computational mathematics01 natural sciencesBounded operatorCombinatoricssymbols.namesakeReconstruction formulaSettore MAT/05 - Analisi MatematicaFOS: MathematicsComputational Science and EngineeringUnbounded operatorA-frame0101 mathematicsMathematicsApplied MathematicsHilbert spaceGraphFunctional Analysis (math.FA)Mathematics - Functional Analysis010101 applied mathematicsComputational MathematicssymbolsWeak A-framesBessel functionAdvances in Computational Mathematics
researchProduct

Groups with exactly one irreducible character of degree divisible byp

2014

Let [math] be a prime. We characterize those finite groups which have precisely one irreducible character of degree divisible by [math] .

AlgebraPure mathematicsAlgebra and Number TheoryCharacter (mathematics)character degreesCharacter tableDegree (graph theory)characters20C15Character groupfinite groupsMathematicsAlgebra & Number Theory
researchProduct

Gabor systems and almost periodic functions

2017

Abstract Inspired by results of Kim and Ron, given a Gabor frame in L 2 ( R ) , we determine a non-countable generalized frame for the non-separable space AP 2 ( R ) of the Besicovic almost periodic functions. Gabor type frames for suitable separable subspaces of AP 2 ( R ) are constructed. We show furthermore that Bessel-type estimates hold for the AP norm with respect to a countable Gabor system using suitable almost periodic norms of sequences.

Almost periodic functionApplied Mathematics010102 general mathematicsAlmost-periodic functions010103 numerical & computational mathematicsGabor frame01 natural sciencesLinear subspaceFunctional Analysis (math.FA)Separable spaceCombinatoricsMathematics - Functional AnalysisFramesNorm (mathematics)42C40 42C15 42A75FOS: MathematicsAP-framesCountable set0101 mathematicsGabor systemsMathematicsAlmost-periodic functions; AP-frames; Frames; Gabor systems; Applied Mathematics
researchProduct

Linear and cyclic radio k-labelings of trees

2007

International audience; Motivated by problems in radio channel assignments, we consider radio k-labelings of graphs. For a connected graph G and an integer k ≥ 1, a linear radio k-labeling of G is an assignment f of nonnegative integers to the vertices of G such that |f(x)−f(y)| ≥ k+1−dG(x,y), for any two distinct vertices x and y, where dG(x,y) is the distance between x and y in G. A cyclic k-labeling of G is defined analogously by using the cyclic metric on the labels. In both cases, we are interested in minimizing the span of the labeling. The linear (cyclic, respectively) radio k-labeling number of G is the minimum span of a linear (cyclic, respectively) radio k-labeling of G. In this p…

Applied Mathematics010102 general mathematicsGraph theory[ INFO.INFO-DM ] Computer Science [cs]/Discrete Mathematics [cs.DM]Astrophysics::Cosmology and Extragalactic Astrophysics0102 computer and information sciences[INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]Span (engineering)01 natural sciencesUpper and lower boundsCombinatoricsGraph theory[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]IntegerRadio channel assignment010201 computation theory & mathematicsCyclic and linear radio k-labelingMetric (mathematics)Path (graph theory)Discrete Mathematics and CombinatoricsOrder (group theory)0101 mathematicsMSC 05C15 05C78ConnectivityMathematics
researchProduct