Search results for "Linea"
showing 10 items of 7724 documents
Extensions of Representable Positive Linear Functionals to Unitized Quasi *-Algebras: A New Method
2014
In this paper we introduce a topological approach for extending a representable linear functional \({\omega}\), defined on a topological quasi *-algebra without unit, to a representable linear functional defined on a quasi *-algebra with unit. In particular, we suppose that \({\omega}\) is continuous and the positive sesquilinear form \({\varphi_\omega}\), associated with \({\omega}\), is closable and prove that the extension \({\overline{\varphi_\omega}^e}\) of the closure \({\overline{\varphi_\omega}}\) is an i.p.s. form. By \({\overline{\varphi_\omega}^e}\) we construct the desired extension.
Partial spreads in finite projective spaces and partial designs
1975
A partial t-spread of a projective space P is a collection 5 p of t-dimensional subspaces of P of the same order with the property that any point of P is contained in at most one element of 50. A partial t-spread 5 p of P is said to be a t-spread if each point of P is contained in an element of 5P; a partial t-spread which is not a spread will be called strictly partial. Partial t-spreads are frequently used for constructions of affine planes, nets, and Sperner spaces (see for instance Bruck and Bose [5], Barlotti and Cofman [2]). The extension of nets to affine planes is related to the following problem: When can a partial t-spread 5 ~ of a projective space P be embedded into a larger part…
On the spectrum of linear combinations of two projections inC*-algebras
2010
In this note, we study the spectrum and give estimations for the spectral radius of linear combinations of two projections in C*-algebras. We also study the commutator of two projections.
The Linear Ordering Polytope
2010
So far we developed a general integer programming approach for solving the LOP. It was based on the canonical IP formulation with equations and 3-dicycle inequalities which was then strengthened by generating mod-k-inequalities as cutting planes. In this chapter we will add further ingredients by looking for problem- specific inequalities. To this end we will study the convex hull of feasible solutions of the LOP: the so-called linear ordering polytope.
Lifting paths on quotient spaces
2009
Abstract Let X be a compactum and G an upper semi-continuous decomposition of X such that each element of G is the continuous image of an ordered compactum. If the quotient space X / G is the continuous image of an ordered compactum, under what conditions is X also the continuous image of an ordered compactum? Examples around the (non-metric) Hahn–Mazurkiewicz Theorem show that one must place severe conditions on G if one wishes to obtain positive results. We prove that the compactum X is the image of an ordered compactum when each g ∈ G has 0-dimensional boundary. We also consider the case when G has only countably many non-degenerate elements. These results extend earlier work of the firs…
Parabolic Equations Minimizing Linear Growth Functionals: L1-Theory
2004
Let Ω be a bounded set in ℝN with boundary of class C1. We are interested in the problem $$ \left\{ \begin{gathered} \frac{{\partial u}} {{\partial t}} = diva\left( {x,Du} \right)in Q = \left( {0,\infty } \right) \times \Omega , \hfill \\ u\left( {t,x} \right) = \phi \left( x \right)on S = \left( {0,\infty } \right) \times \partial \Omega , \hfill \\ u\left( {0,x} \right) = u_0 \left( x \right)in x \in \Omega \hfill \\ \end{gathered} \right. $$ (1) where ϕ ∈ L1(∂Ω), u0 ∈ L2(Ω) and a(x, ξ) = ∇ξ f(x, ξ, f being a function with linear growth in ‖ξ‖ as ‖ξ‖ → ∞. One of the classical examples is the nonparametric area integrand for which \( f(x,\xi ) = \sqrt {1 + \left\| \xi \right\|^2 } \). Prob…
Circuit Lower Bounds via Ehrenfeucht-Fraisse Games
2006
In this paper we prove that the class of functions expressible by first order formulas with only two variables coincides with the class of functions computable by AC/sup 0/ circuits with a linear number of gates. We then investigate the feasibility of using Ehrenfeucht-Fraisse games to prove lower bounds for that class of circuits, as well as for general AC/sup 0/ circuits.
Super-Exponential Size Advantage of Quantum Finite Automata with Mixed States
2008
Quantum finite automata with mixed states are proved to be super-exponentially more concise rather than quantum finite automata with pure states. It was proved earlier by A.Ambainis and R.Freivalds that quantum finite automata with pure states can have exponentially smaller number of states than deterministic finite automata recognizing the same language. There was a never published "folk theorem" proving that quantum finite automata with mixed states are no more than super-exponentially more concise than deterministic finite automata. It was not known whether the super-exponential advantage of quantum automata is really achievable. We use a novel proof technique based on Kolmogorov complex…
On the Quadratic Type of Some Simple Self-Dual Modules over Fields of Characteristic Two
1997
Let G be a finite group and let K be an algebraically closed field of Ž characteristic 2. Let V be a non-trivial simple self-dual KG-module we . say that V is self-dual if it is isomorphic to its dual V * . It is a theorem of w x Fong 4, Lemma 1 that in this case there is a non-degenerate G-invariant alternating bilinear form, F, say, defined on V = V. We say that V is a KG-module of quadratic type if F is the polarization of a non-degenerate w x G-invariant quadratic form defined on V. In a previous paper 6 , the present authors described some methods to decide if such a module V is of w x quadratic type. One of the main results of 6 is the following. Suppose that Ž . G is a group with a s…
Span programs for functions with constant-sized 1-certificates
2012
Besides the Hidden Subgroup Problem, the second large class of quantum speed-ups is for functions with constant-sized 1-certificates. This includes the OR function, solvable by the Grover algorithm, the element distinctness, the triangle and other problems. The usual way to solve them is by quantum walk on the Johnson graph. We propose a solution for the same problems using span programs. The span program is a computational model equivalent to the quantum query algorithm in its strength, and yet very different in its outfit. We prove the power of our approach by designing a quantum algorithm for the triangle problem with query complexity O(n35/27) that is better than O(n13/10) of the best p…