Search results for "Combinatorics"
showing 10 items of 1770 documents
Cores for parabolic operators with unbounded coefficients
2009
Abstract Let A = ∑ i , j = 1 N q i j ( s , x ) D i j + ∑ i = 1 N b i ( s , x ) D i be a family of elliptic differential operators with unbounded coefficients defined in R N + 1 . In [M. Kunze, L. Lorenzi, A. Lunardi, Nonautonomous Kolmogorov parabolic equations with unbounded coefficients, Trans. Amer. Math. Soc., in press], under suitable assumptions, it has been proved that the operator G : = A − D s generates a semigroup of positive contractions ( T p ( t ) ) in L p ( R N + 1 , ν ) for every 1 ⩽ p + ∞ , where ν is an infinitesimally invariant measure of ( T p ( t ) ) . Here, under some additional conditions on the growth of the coefficients of A , which cover also some growths with an ex…
(p,q)-summing sequences
2002
Abstract A sequence (x j ) in a Banach space X is (p,q) -summing if for any weakly q -summable sequence (x j ∗ ) in the dual space we get a p -summable sequence of scalars (x j ∗ (x j )) . We consider the spaces formed by these sequences, relating them to the theory of (p,q) -summing operators. We give a characterization of the case p=1 in terms of integral operators, and show how these spaces are relevant for a general question on Banach spaces and their duals, in connection with Grothendieck theorem.
On n–Fold Blocking Sets
1986
An n-fold blocking set is a set of n-disjoint blocking sets. We shall prove upper and lower bounds for the number of components in an n-fold blocking set in projective and affine spaces.
On the longest common factor problem
2008
The Longest Common Factor (LCF) of a set of strings is a well studied problem having a wide range of applications in Bioinformatics: from microarrays to DNA sequences analysis. This problem has been solved by Hui (2000) who uses a famous constant-time solution to the Lowest Common Ancestor (LCA) problem in trees coupled with use of suffix trees. A data structure for the LCA problem, although linear in space and construction time, introduces a multiplicative constant in both space and time that reduces the range of applications in many biological applications. In this article we present a new method for solving the LCF problem using the suffix tree structure with an auxiliary array that take…
Conditional Random Quantities and Iterated Conditioning in the Setting of Coherence
2013
We consider conditional random quantities (c.r.q.’s) in the setting of coherence. Given a numerical r.q. X and a non impossible event H, based on betting scheme we represent the c.r.q. X|H as the unconditional r.q. XH + μH c , where μ is the prevision assessed for X|H. We develop some elements for an algebra of c.r.q.’s, by giving a condition under which two c.r.q.’s X|H and Y|K coincide. We show that X|HK coincides with a suitable c.r.q. Y|K and we apply this representation to Bayesian updating of probabilities, by also deepening some aspects of Bayes’ formula. Then, we introduce a notion of iterated c.r.q. (X|H)|K, by analyzing its relationship with X|HK. Our notion of iterated conditiona…
Countably compact weakly Whyburn spaces
2015
The weak Whyburn property is a generalization of the classical sequential property that was studied by many authors. A space X is weakly Whyburn if for every non-closed set \({A \subset X}\) there is a subset \({B \subset A}\) such that \({\overline{B} \setminus A}\) is a singleton. We prove that every countably compact Urysohn space of cardinality smaller than the continuum is weakly Whyburn and show that, consistently, the Urysohn assumption is essential. We also give conditions for a (countably compact) weakly Whyburn space to be pseudoradial and construct a countably compact weakly Whyburn non-pseudoradial regular space, which solves a question asked by Angelo Bella in private communica…
Estimates of Jacobians by subdeterminants
2002
Let ƒ: Ω → ℝn be a mapping in the Sobolev space W1,n−1(Ω,ℝn), n ≥ 2. We assume that the determinant of the differential matrix Dƒ (x) is nonnegative, while the cofactor matrix D#ƒ satisfies\(|D^\sharp f|^{\frac{n}{{n - 1}}} \in L^P (\Omega )\), where Lp(Ω) is an Orlicz space. We show that, under the natural Divergence Condition on P, see (1.10), the Jacobian lies in Lloc1 (Ω). Estimates above and below Lloc1 (Ω) are also studied. These results are stronger than the previously known estimates, having assumed integrability conditions on the differential matrix.
Estimating the length of minimal spanning trees in compression of files
1984
Compression of a formatted file by a minimal spanning tree (MST) is studied. Here the records of the file are considered as the nodes of a weighted undirected graph. Each record pair is connected in the graph and the corresponding arc is weighted by the sum of field lengths of those fields which differ in the two records. The actual compression is made by constructing an MST of the graph and by storing it in an economic way to preserve the information of the file. The length of the MST is a useful measure in the estimation of the power of the compression. In the paper we study upper bounds of this length, especially in the case where the field lengths of the different fields may vary. The u…
A dual of 4-regular graph forG × C2n
2003
Abstract A graph is said h-decomposable if its edge-set is decomposable into edge-disjoint hamiltonian cycles. Jha [3] conjectured that if G is a non-bipartite h-decomposable graph on even number of vertices, then G × K2 is h-decomposable. We use the notion of dual graph defined in [4], we prove that if G = Q1,2 ⊕ C3,4 is a 4-regular non-bipartite h-decomposable graph and the dual graphs relative to Q1,2 and C3,4 are connected then G × K 2 and G × C 2n are h-decomposable (where C 2n is an even cycle).
Lower Bounds and Hierarchies for Quantum Memoryless Communication Protocols and Quantum Ordered Binary Decision Diagrams with Repeated Test
2017
We explore multi-round quantum memoryless communication protocols. These are restricted version of multi-round quantum communication protocols. The “memoryless” term means that players forget history from previous rounds, and their behavior is obtained only by input and message from the opposite player. The model is interesting because this allows us to get lower bounds for models like automata, Ordered Binary Decision Diagrams and streaming algorithms. At the same time, we can prove stronger results with this restriction. We present a lower bound for quantum memoryless protocols. Additionally, we show a lower bound for Disjointness function for this model. As an application of communicatio…