Search results for "combinatoric"
showing 10 items of 1776 documents
Pointwise characterizations of Hardy-Sobolev functions
2006
We establish simple pointwise characterizations of functions in the Hardy-Sobolev spaces within the range n/(n+1)<p <=1. In addition, classical Hardy inequalities are extended to the case p <= 1.
A pointwise selection principle for metric semigroup valued functions
2008
Abstract Let ∅ ≠ T ⊂ R , ( X , d , + ) be an additive commutative semigroup with metric d satisfying d ( x + z , y + z ) = d ( x , y ) for all x , y , z ∈ X , and X T the set of all functions from T into X . If n ∈ N and f , g ∈ X T , we set ν ( n , f , g , T ) = sup ∑ i = 1 n d ( f ( t i ) + g ( s i ) , g ( t i ) + f ( s i ) ) , where the supremum is taken over all numbers s 1 , … , s n , t 1 , … , t n from T such that s 1 ⩽ t 1 ⩽ s 2 ⩽ t 2 ⩽ ⋯ ⩽ s n ⩽ t n . We prove the following pointwise selection theorem: If a sequence of functions { f j } j ∈ N ⊂ X T is such that the closure in X of the set { f j ( t ) } j ∈ N is compact for each t ∈ T , and lim n → ∞ ( 1 n lim N → ∞ sup j , k ⩾ N , j…
Minimal Absent Words in Rooted and Unrooted Trees
2019
We extend the theory of minimal absent words to (rooted and unrooted) trees, having edges labeled by letters from an alphabet \(\varSigma \) of cardinality \(\sigma \). We show that the set \(\text {MAW}(T)\) of minimal absent words of a rooted (resp. unrooted) tree T with n nodes has cardinality \(O(n\sigma )\) (resp. \(O(n^{2}\sigma )\)), and we show that these bounds are realized. Then, we exhibit algorithms to compute all minimal absent words in a rooted (resp. unrooted) tree in output-sensitive time \(O(n+|\text {MAW}(T)|)\) (resp. \(O(n^{2}+|\text {MAW}(T)|)\) assuming an integer alphabet of size polynomial in n.
On Codimensions of Algebras with Involution
2020
Let A be an associative algebra with involution ∗ over a field F of characteristic zero. One associates to A, in a natural way, a numerical sequence \(c^{\ast }_n(A),\)n = 1, 2, …, called the sequence of ∗-codimensions of A which is the main tool for the quantitative investigation of the polynomial identities satisfied by A. In this paper we focus our attention on \(c^{\ast }_n(A),\)n = 1, 2, …, by presenting some recent results about it.
The Lie algebra of polynomial vector fields and the Jacobian conjecture
1998
The Jacobian conjecture for polynomial maps ϕ:Kn→Kn is shown to be equivalent to a certain Lie algebra theoretic property of the Lie algebra\(\mathbb{D}\) of formal vector fields inn variables. To be precise, let\(\mathbb{D}_0 \) be the unique subalgebra of codimensionn (consisting of the singular vector fields),H a Cartan subalgebra of\(\mathbb{D}_0 \),Hλ the root spaces corresponding to linear forms λ onH and\(A = \oplus _{\lambda \in {\rm H}^ * } H_\lambda \). Then every polynomial map ϕ:Kn→Kn with invertible Jacobian matrix is an automorphism if and only if every automorphism Φ of\(\mathbb{D}\) with Φ(A)\( \subseteq A\) satisfies Φ(A)=A.
Permutation Tests in Linear Regression
2015
Exact permutation tests are available only in rather simple linear models. The problem is that, although standard assumptions allow permuting the errors of the model, we cannot permute them in practice, because they are unobservable. Nevertheless, the residuals of the model can be permuted. A proof is given here which shows that it is possible to approximate the unobservable permutation distribution where the true errors are permuted by permuting the residuals. It is shown that approximation holds asymptotically and almost surely for certain quadratic statistics as well as for statistics which are expressible as the maximum of appropriate linear functions. The result is applied to testing t…
Matrix algebras with degenerate traces and trace identities
2022
In this paper we study matrix algebras with a degenerate trace in the framework of the theory of polynomial identities. The first part is devoted to the study of the algebra $D_n$ of $n \times n$ diagonal matrices. We prove that, in case of a degenerate trace, all its trace identities follow by the commutativity law and by pure trace identities. Moreover we relate the trace identities of $D_{n+1}$ endowed with a degenerate trace, to those of $D_n$ with the corresponding trace. This allows us to determine the generators of the trace T-ideal of $D_3$. In the second part we study commutative subalgebras of $M_k(F)$, denoted by $C_k$ of the type $F + J$ that can be endowed with the so-called st…
Blenders near polynomial product maps of $\mathbb C^2$
2021
In this paper we show that if $p$ is a polynomial which bifurcates then the product map $(z,w)\mapsto(p(z),q(w))$ can be approximated by polynomial skew products possessing special dynamical objets called blenders. Moreover, these objets can be chosen to be of two types : repelling or saddle. As a consequence, such product map belongs to the closure of the interior of two different sets : the bifurcation locus of $H_d(\mathbb P^2)$ and the set of endomorphisms having an attracting set of non-empty interior. In an independent part, we use perturbations of H\'enon maps to obtain examples of attracting sets with repelling points and also of quasi-attractors which are not attracting sets.
Zeroes of real polynomials on C(K) spaces
2007
AbstractFor a compact Hausdorff topological space K, we show that the function space C(K) must satisfy the following dichotomy: (i) either it admits a positive definite continuous 2-homogeneous real-valued polynomial, (ii) or every continuous 2-homogeneous real-valued polynomial vanishes in a non-separable closed linear subspace. Moreover, if K does not have the Countable Chain Condition, then every continuous polynomial, not necessarily homogeneous and with arbitrary degree, has constant value in an isometric copy of c0(Γ), for some uncountable Γ.
Upper bounds for the zeros of ultraspherical polynomials
1990
AbstractFor k = 1, 2, …, [n2] let xnk(λ) denote the Kth positive zero in decreasing order of the ultraspherical polynomial Pn(λ)(x). We establish upper bounds for xnk(λ). All the bounds become exact when λ = 0 and, in some cases (see case (iii) of Theorem 3.1), also when λ = 1. As a consequence of our results, we obtain for the largest zero xn1(λ)0.. We point out that our results remain useful for large values of λ. Numerical examples show that our upper bounds are quite sharp.