Search results for "Bin"
showing 10 items of 14592 documents
On two classes of finite supersoluble groups
2017
ABSTRACTLet ℨ be a complete set of Sylow subgroups of a finite group G, that is, a set composed of a Sylow p-subgroup of G for each p dividing the order of G. A subgroup H of G is called ℨ-S-semipermutable if H permutes with every Sylow p-subgroup of G in ℨ for all p∉π(H); H is said to be ℨ-S-seminormal if it is normalized by every Sylow p-subgroup of G in ℨ for all p∉π(H). The main aim of this paper is to characterize the ℨ-MS-groups, or groups G in which the maximal subgroups of every Sylow subgroup in ℨ are ℨ-S-semipermutable in G and the ℨ-MSN-groups, or groups in which the maximal subgroups of every Sylow subgroup in ℨ are ℨ-S-seminormal in G.
Symmetric and finitely symmetric polynomials on the spaces ℓ∞ and L∞[0,+∞)
2018
We consider on the space l∞ polynomials that are invariant regarding permutations of the sequence variable or regarding finite permutations. Accordingly, they are trivial or factor through c0. The analogous study, with analogous results, is carried out on L∞[0,+∞), replacing the permutations of N by measurable bijections of [0,+∞) that preserve the Lebesgue measure.
Global Lp -integrability of the derivative of a quasiconformal mapping
1988
Let f be a quasiconformal mapping of an open bounded set U in Rn into Rn . Then f′ belongs to Lp(U) for some p > n provided that f satisfies (a) U is a uniform domain and fU is a John domain or (b) f is quasisymmetric and U satisfies a metric plumpness condition.
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.
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…
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…
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, …
Restricted compositions and permutations: from old to new Gray codes
2011
Any Gray code for a set of combinatorial objects defines a total order relation on this set: x is less than y if and only if y occurs after x in the Gray code list. Let @? denote the order relation induced by the classical Gray code for the product set (the natural extension of the Binary Reflected Gray Code to k-ary tuples). The restriction of @? to the set of compositions and bounded compositions gives known Gray codes for those sets. Here we show that @? restricted to the set of bounded compositions of an interval yields still a Gray code. An n-composition of an interval is an n-tuple of integers whose sum lies between two integers; and the set of bounded n-compositions of an interval si…
Statistics-preserving bijections between classical and cyclic permutations
2012
Recently, Elizalde (2011) [2] has presented a bijection between the set C"n"+"1 of cyclic permutations on {1,2,...,n+1} and the set of permutations on {1,2,...,n} that preserves the descent set of the first n entries and the set of weak excedances. In this paper, we construct a bijection from C"n"+"1 to S"n that preserves the weak excedance set and that transfers quasi-fixed points into fixed points and left-to-right maxima into themselves. This induces a bijection from the set D"n of derangements to the set C"n"+"1^q of cycles without quasi-fixed points that preserves the weak excedance set. Moreover, we exhibit a kind of discrete continuity between C"n"+"1 and S"n that preserves at each s…
Comparative Theoretical Analysis of BN Nanotubes Doped with Al, P, Ga, As, In, and Sb
2013
SUMMARY AND CONCLUDING REMARKS We have performed large-scale first-principles calculations ofthe electronic structure of (5,5) boron nitride nanotubescontaining the following substitutional impurity atoms: Al, P,Ga, As, In, and Sb. Calculations have been performed using thetwo methods: (i) linear combination of atomic orbitals(LCAO) with the atomic-centered Gaussian-type functions asa basis set and (ii) linearized augmented cylindrical wave(LACW) accompanied with the local density functional andmuffin-tin approximations for the electronic potential. In arelatively good qualitative agreement, both methods predict lowformation energies and, thus, relative stability of point defectsthat are assoc…