Search results for "Combinatorics"

More restrictive Gray codes for necklaces and Lyndon words

2008

In the last years, the order induced by the Binary Reflected Gray Code or its generalizations shown an increasing interest. In this note we show that the BRGC order induces a cyclic 2-Gray code on the set of binary necklaces and Lyndon words and a cyclic 3-Gray code on the unordered counterparts. This is an improvement and a generalization to unlabeled words of the result in [V. Vajnovszki, Gray code order for Lyndon words, Discrete Math. Theoret. Comput. Sci. 9 (2) (2007) 145-152; M. Weston, V. Vajnovszki, Gray codes for necklaces and Lyndon words of arbitrary base, Pure Mathematics and Applications/Algebra and Theoretical Computer Science, in press]; however an algorithmic implementation …

Approximation properties of q-Kantorovich-Stancu operator

2015

In this paper we study some properties of Kantorovich-type generalizations of the q-Stancu operators. We obtain some approximation properties for these operators, estimating the rate of convergence by using the first and second modulus of continuity. Also, we investigate the statistical approximation properties of the q-Kantorovich-Stancu operators using the Korovkin-type statistical approximation theorem.

Spaces of Operator-valued Functions Measurable with Respect to the Strong Operator Topology

2009

Let X and Y be Banach spaces and (Ω, Σ, μ) a finite measure space. In this note we introduce the space L p /μ; ℒ(X, Y)] consisting of all (equivalence classes of) functions Φ:Ω↦ℒ(X, Y) such that ω↦Φ(ω)x is strongly μ-measurable for all x∈X and ω↦Φ(ω)f(ω) belongs to L 1(μ; Y) for all f∈L p′ (μ; X), 1/p+1/p′=1. We show that functions in L p /μ; ℒ(X, Y)] define operator-valued measures with bounded p-variation and use these spaces to obtain an isometric characterization of the space of all ℒ(X, Y)-valued multipliers acting boundedly from L p (μ; X) into L q (μ; Y), 1≤q<p<∞.

A survey on solvable sesquilinear forms

2018

The aim of this paper is to present a unified theory of many Kato type representation theorems in terms of solvable forms on a Hilbert space \((H,\langle\cdot,\cdot\rangle)\) In particular, for some sesquilinear forms Ω on a dense domain \(D\subseteq\mathcal {H}\) one looks for a representation \(\Omega(\xi,\eta)= \langle T\xi,\eta\rangle\) \((\xi\epsilon\mathcal{D}\mathcal(T),\eta\epsilon D)\) where T is a densely defined closed operator with domain \(D(\mathcal{T})\subseteq \mathcal{D}\). There are two characteristic aspects of a solvable form on H. One is that the domain of the form can be turned into a reexive Banach space that need not be a Hilbert space. The second one is that represe…

Advanced Optical Processing of Microwave Signals

2005

The authors present a review on the recent approaches proposed to implement transversal RF filters. Different tunable transversal filters consisting of wavelength tunable optical taps and those employing the tunability of dispersive devices are presented showing their high-performance characteristics. A comprehensive review of the fundamentals and a discussion on the main limitation of these structures are also included.

Non-intersecting Complexity

2006

A new complexity measure for Boolean functions is introduced in this article. It has a link to the query algorithms: it stands between both polynomial degree and non-deterministic complexity on one hand and still is a lower bound for deterministic complexity. Some inequalities and counterexamples are presented and usage in symmetrisation polynomials is considered.

"Table 1" of "$\Lambda$ polarization in associated K$^+$ - $\Lambda$ electro-production"

2000

LAMBDA polarization, with respect to the p_gamma x p_k axis.

On The Least Number of Palindromes in an Infinite Word

2012

On Approximate Jumbled Pattern Matching in Strings

2011

Given a string s, the Parikh vector of s, denoted p(s), counts the multiplicity of each character in s. Searching for a match of a Parikh vector q in the text s requires finding a substring t of s with p(t) = q. This can be viewed as the task of finding a jumbled (permuted) version of a query pattern, hence the term Jumbled Pattern Matching. We present several algorithms for the approximate version of the problem: Given a string s and two Parikh vectors u, v (the query bounds), find all maximal occurrences in s of some Parikh vector q such that u <= q <= v. This definition encompasses several natural versions of approximate Parikh vector search. We present an algorithm solving this problem …

Partial isometries and the conjecture of C.K. Fong and S.K. Tsui

2016

Abstract We investigate some bounded linear operators T on a Hilbert space which satisfy the condition | T | ≤ | Re T | . We describe the maximum invariant subspace for a contraction T on which T is a partial isometry to obtain that, in certain cases, the above condition ensures that T is self-adjoint. In other words we show that the Fong–Tsui conjecture holds for partial isometries, contractive quasi-isometries, or 2-quasi-isometries, and Brownian isometries of positive covariance, or even for a more general class of operators.