Search results for "maximal"
showing 10 items of 239 documents
Restriction of odd degree characters and natural correspondences
2016
Let $q$ be an odd prime power, $n > 1$, and let $P$ denote a maximal parabolic subgroup of $GL_n(q)$ with Levi subgroup $GL_{n-1}(q) \times GL_1(q)$. We restrict the odd-degree irreducible characters of $GL_n(q)$ to $P$ to discover a natural correspondence of characters, both for $GL_n(q)$ and $SL_n(q)$. A similar result is established for certain finite groups with self-normalizing Sylow $p$-subgroups. We also construct a canonical bijection between the odd-degree irreducible characters of $S_n$ and those of $M$, where $M$ is any maximal subgroup of $S_n$ of odd index; as well as between the odd-degree irreducible characters of $G = GL_n(q)$ or $GU_n(q)$ with $q$ odd and those of $N_{G}…
On the continuity of discrete maximal operators in Sobolev spaces
2014
We investigate the continuity of discrete maximal operators in Sobolev space W 1;p (R n ). A counterexample is given as well as it is shown that the continuity follows under certain sucient assumptions. Especially, our research verifies that for the continuity in Sobolev spaces the role of the partition of the unity used in the construction of the maximal operator is very delicate.
Weighted norm inequalities in a bounded domain by the sparse domination method
2019
AbstractWe prove a local two-weight Poincaré inequality for cubes using the sparse domination method that has been influential in harmonic analysis. The proof involves a localized version of the Fefferman–Stein inequality for the sharp maximal function. By establishing a local-to-global result in a bounded domain satisfying a Boman chain condition, we show a two-weight p-Poincaré inequality in such domains. As an application we show that certain nonnegative supersolutions of the p-Laplace equation and distance weights are p-admissible in a bounded domain, in the sense that they support versions of the p-Poincaré inequality.
On second maximal subgroups of Sylow subgroups of finite groups
2011
Abstract Finite groups in which the second maximal subgroups of the Sylow p -subgroups, p a fixed prime, cover or avoid the chief factors of some of its chief series are completely classified.
Blood and skeletal muscle ageing determined by epigenetic clocks and their associations with physical activity and functioning
2021
AbstractThe aim of this study was to investigate the correspondence of different biological ageing estimates (i.e. epigenetic age) in blood and muscle tissue and their associations with physical activity (PA), physical function and body composition. Two independent cohorts (N = 139 and N = 47) were included, whose age span covered adulthood (23–69 years). Whole blood and m. vastus lateralis samples were collected, and DNA methylation was analysed. Four different DNA methylation age (DNAmAge) estimates were calculated using genome-wide methylation data and publicly available online tools. A novel muscle-specific methylation age was estimated using the R-package ‘MEAT’. PA was measured with q…
The sequence of open and closed prefixes of a Sturmian word
2017
A finite word is closed if it contains a factor that occurs both as a prefix and as a suffix but does not have internal occurrences, otherwise it is open. We are interested in the {\it oc-sequence} of a word, which is the binary sequence whose $n$-th element is $0$ if the prefix of length $n$ of the word is open, or $1$ if it is closed. We exhibit results showing that this sequence is deeply related to the combinatorial and periodic structure of a word. In the case of Sturmian words, we show that these are uniquely determined (up to renaming letters) by their oc-sequence. Moreover, we prove that the class of finite Sturmian words is a maximal element with this property in the class of binar…
Monoids and Maximal Codes
2011
In recent years codes that are not Uniquely Decipherable (UD) are been studied partitioning them in classes that localize the ambiguities of the code. A natural question is how we can extend the notion of maximality to codes that are not UD. In this paper we give an answer to this question. To do this we introduce a partial order in the set of submonoids of a monoid showing the existence, in this poset, of maximal elements that we call full monoids. Then a set of generators of a full monoid is, by definition, a maximal code. We show how this definition extends, in a natural way, the existing definition concerning UD codes and we find a characteristic property of a monoid generated by a maxi…
Primitive sets of words
2020
Given a (finite or infinite) subset $X$ of the free monoid $A^*$ over a finite alphabet $A$, the rank of $X$ is the minimal cardinality of a set $F$ such that $X \subseteq F^*$. We say that a submonoid $M$ generated by $k$ elements of $A^*$ is {\em $k$-maximal} if there does not exist another submonoid generated by at most $k$ words containing $M$. We call a set $X \subseteq A^*$ {\em primitive} if it is the basis of a $|X|$-maximal submonoid. This definition encompasses the notion of primitive word -- in fact, $\{w\}$ is a primitive set if and only if $w$ is a primitive word. By definition, for any set $X$, there exists a primitive set $Y$ such that $X \subseteq Y^*$. We therefore call $Y$…
Bootstrap validation of links of a minimum spanning tree
2018
We describe two different bootstrap methods applied to the detection of a minimum spanning tree obtained from a set of multivariate variables. We show that two different bootstrap procedures provide partly distinct information that can be highly informative about the investigated complex system. Our case study, based on the investigation of daily returns of a portfolio of stocks traded in the US equity markets, shows the degree of robustness and completeness of the information extracted with popular information filtering methods such as the minimum spanning tree and the planar maximally filtered graph. The first method performs a "row bootstrap" whereas the second method performs a "pair bo…
The Intersection of $3$-Maximal Submonids
2020
Very little is known about the structure of the intersection of two $k$-generated monoids of words, even for $k=3$. Here we investigate the case of $k$-maximal monoids, that is, monoids whose basis of cardinality $k$ cannot be non-trivially decomposed into at most $k$ words. We characterize the intersection in the case of two $3$-maximal monoids.