Search results for "combinatoric"
showing 10 items of 1776 documents
An Extension of Weyl’s Equidistribution Theorem to Generalized Polynomials and Applications
2020
Author's accepted manuscript. This is a pre-copyedited, author-produced version of an article accepted for publication in International Mathematics Research Notices following peer review. The version of record Bergelson, V., Knutson, I. J. H. & Son, Y. (2020). An Extension of Weyl’s Equidistribution Theorem to Generalized Polynomials and Applications. International Mathematics Research Notices, 2021(19), 14965-15018 is available online at: https://academic.oup.com/imrn/article/2021/19/14965/5775499 and https://doi.org/10.1093/imrn/rnaa035. Generalized polynomials are mappings obtained from the conventional polynomials by the use of the operations of addition and multiplication and taking th…
Algebras with intermediate growth of the codimensions
2006
AbstractLet F be a field of characteristic zero and let A be an F-algebra. The polynomial identities satisfied by A can be measured through the asymptotic behavior of the sequence of codimensions and the sequence of colengths of A. For finite dimensional algebras we show that the colength sequence of A is polynomially bounded and the codimension sequence cannot have intermediate growth. We then prove that for general nonassociative algebras intermediate growth of the codimensions is allowed. In fact, for any real number 0<β<1, we construct an algebra A whose sequence of codimensions grows like nnβ.
Varieties of Algebras with Superinvolution of Almost Polynomial Growth
2015
Let A be an associative algebra with superinvolution ∗ over a field of characteristic zero and let $c_{n}^{\ast }(A)$ be its sequence of corresponding ∗-codimensions. In case A is finite dimensional, we prove that such sequence is polynomially bounded if and only if the variety generated by A does not contain three explicitly described algebras with superinvolution. As a consequence we find out that no intermediate growth of the ∗-codimensions between polynomial and exponential is allowed.
A continuing debate in elementary geometry: the Simson–Wallace line and its many generalisations
2016
For some years now the importance has been appraised of demonstrating elementary geometry to pupils and future teachers through interactive geometry software. This fits within a view of the teaching of geometry that stresses a hands-on approach, thanks to which it is possible to teach the subject via historical syllabi, touching on ideas from different origins and of a transversal nature. The debate about the role of elementary geometry in the last 30 years is connected to this, with contributions by scholars such as Yaglom, Scimemi and Betti. In the perspective of following a sequence of elementary geometry constructions historically connected with each other, we suggest a path that analys…
On the order of indeterminate moment problems
2013
For an indeterminate moment problem we denote the orthonormal polynomials by P_n. We study the relation between the growth of the function P(z)=(\sum_{n=0}^\infty|P_n(z)|^2)^{1/2} and summability properties of the sequence (P_n(z)). Under certain assumptions on the recurrence coefficients from the three term recurrence relation zP_n(z)=b_nP_{n+1}(z)+a_nP_n(z)+b_{n-1}P_{n-1}(z), we show that the function P is of order \alpha with 0<\alpha<1, if and only if the sequence (P_n(z)) is absolutely summable to any power greater than 2\alpha. Furthermore, the order \alpha is equal to the exponent of convergence of the sequence (b_n). Similar results are obtained for logarithmic order and for more ge…
Optimal selection of thek best of a sequence withk stops
1997
We first consider the situation in which the decision-maker is allowed to have five choices with purpose to choose exactly the five absolute best candidates fromN applicants. The optimal stopping rule and the maximum probability of making the right five-choice are given for largeN eN, the maximum asymptotic value of the probability of the best choice being limN→∝P (win) ≈ 0.104305. Then, we study the general problem of selecting thek best of a sequence withk stops, constructing first a rough solution for this problem. Using this suboptimal solution, we find an approximation for the optimal probability valuesPk of the form $$P_k \approx \frac{1}{{(e - 1)k + 1}}$$ for any k eN.
Derived length and character degrees of solvable groups
2003
We prove that the derived length of a solvable group is bounded in terms of certain invariants associated to the set of character degrees and improve some of the known bounds. We also bound the derived length of a Sylow p-subgroup of a solvable group by the number of different p-parts of the character degrees of the whole group.
A characterization of the line set of an odd-dimensional Baer subspace
1990
Generalizing a theorem of Beutelspacher and Seeger, we consider line sets\(\mathcal{L}\) inP=PG(2t + 1,q),t ∈ IN, with the following properties: (1) any (t + 1)-dimensional subspace ofP contains at least one line of\(\mathcal{L}\), (2) if a pointx ofP is incident with at least two lines of\(\mathcal{L}\) then the points in the factor geometryP/x which are induced by the lines of\(\mathcal{L}\) throughx form a blocking set of type (t, 1) inP/x, (3) any line of\(\mathcal{L}\) is coplanar with at least one further line of\(\mathcal{L}\). We will show that the examples of minimal cardinality are exactly the line sets of Baer subspaces ofP.
Degrees of characters in the principal block
2021
Abstract Let G be a finite group. We prove that if the set of degrees of characters in the principal p-block of G has size at most 2 then G is p-solvable, and G / O p ′ ( G ) has a metabelian normal Sylow p-subgroup. The general question of proving that if an arbitrary p-block has two degrees then their defect groups are metabelian remains open.
On finite products of soluble groups
1998
Let the finite groupG =AB be the product of two soluble subgroupsA andB, and letπ be a set of primes. We investigate under which conditions for the maximal normalπ-subgroups ofA, B andG the following holds:Oπ(G) ∩Oπ(G) ⊆Oπ(G).