Search results for "programming."
showing 10 items of 3035 documents
Spectral invariance, ellipticity, and the Fredholm property for pseudodifferential operators on weighted Sobolev spaces
1992
The pseudodifferential operators with symbols in the Grushin classes \~S inf0 supρ,δ , 0 ≤ δ < ρ ≤ 1, of slowly varying symbols are shown to form spectrally invariant unital Frecher-*-algebras (Ψ*-algebras) in L(L 2(R n )) and in L(H γ st ) for weighted Sobolev spaces H infγ sup defined via a weight d function γ. In all cases, the Fredholm property of an operator can be characterized by uniform ellipticity of the symbol. This gives a converse to theorems of Grushin and Kumano-Ta-Taniguchi. Both, the spectrum and the Fredholm spectrum of an operator turn out to be independent of the choices of s, t and γ. The characterization of the Fredholm property by uniform ellipticity leads to an index …
Operators in Rigged Hilbert spaces: some spectral properties
2014
A notion of resolvent set for an operator acting in a rigged Hilbert space $\D \subset \H\subset \D^\times$ is proposed. This set depends on a family of intermediate locally convex spaces living between $\D$ and $\D^\times$, called interspaces. Some properties of the resolvent set and of the corresponding multivalued resolvent function are derived and some examples are discussed.
An Exact Algorithm for the Quadratic Assignment Problem on a Tree
1989
The Tree QAP is a special case of the Quadratic Assignment Problem (QAP) where the nonzero flows form a tree. No condition is required for the distance matrix. This problem is NP-complete and is also a generalization of the Traveling Salesman Problem. In this paper, we present a branch-and-bound algorithm for the exact solution of the Tree QAP based on an integer programming formulation of the problem. The bounds are computed using a Lagrangian relaxation of this formulation. To solve the relaxed problem, we present a Dynamic Programming algorithm which is polynomially bounded. The obtained lower bound is very sharp and equals the optimum in many cases. This fact allows us to employ a redu…
Logics for context-free languages
1995
We define matchings, and show that they capture the essence of context-freeness. More precisely, we show that the class of context-free languages coincides with the class of those sets of strings which can be defined by sentences of the form ∃ bϕ, where ϕ is first order, b is a binary predicate symbol, and the range of the second order quantifier is restricted to the class of matchings. Several variations and extensions are discussed.
Discrete Mathematics in Lower School Grades? Situation and Possibilities in Italy
2017
This paper presents an overview of the Italian situation in teaching discrete mathematics in primary and middle school, taking into account the national teaching guidelines and their connection with the subject. We describe research conducted with about 150 teachers, interviewed in a preliminary questionnaire. The data collected shows, for all teaching grades, interest in having more discrete mathematics in the school curriculum even if there are some difficulties in teaching it and in inserting it in the usual mathematical activities at school, mostly related to teachers’ knowledge and self-confidence about the subject. We also discuss results and future plans for a continuing research pro…
On operator valued sequences of multipliers and R-boundedness
2007
AbstractIn recent papers (cf. [J.L. Arregui, O. Blasco, (p,q)-Summing sequences, J. Math. Anal. Appl. 274 (2002) 812–827; J.L. Arregui, O. Blasco, (p,q)-Summing sequences of operators, Quaest. Math. 26 (2003) 441–452; S. Aywa, J.H. Fourie, On summing multipliers and applications, J. Math. Anal. Appl. 253 (2001) 166–186; J.H. Fourie, I. Röntgen, Banach space sequences and projective tensor products, J. Math. Anal. Appl. 277 (2) (2003) 629–644]) the concept of (p,q)-summing multiplier was considered in both general and special context. It has been shown that some geometric properties of Banach spaces and some classical theorems can be described using spaces of (p,q)-summing multipliers. The p…
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…
Randomized renaming in shared memory systems.
2021
Abstract Renaming is a task in distributed computing where n processes are assigned new names from a name space of size m . The problem is called tight if m = n , and loose if m > n . In recent years renaming came to the fore again and new algorithms were developed. For tight renaming in asynchronous shared memory systems, Alistarh et al. describe a construction based on the AKS network that assigns all names within O ( log n ) steps per process. They also show that, depending on the size of the name space, loose renaming can be done considerably faster. For m = ( 1 + ϵ ) ⋅ n and constant ϵ , they achieve a step complexity of O ( log log n ) . In this paper we consider tight as well as loos…
Impact of common property (E.A.) on fixed point theorems in fuzzy metric spaces
2011
We observe that the notion of common property (E.A.) relaxes the required containment of range of one mapping into the range of other which is utilized to construct the sequence of joint iterates. As a consequence, a multitude of recent fixed point theorems of the existing literature are sharpened and enriched.
Probabilities to Accept Languages by Quantum Finite Automata
1999
We construct a hierarchy of regular languages such that the current language in the hierarchy can be accepted by 1-way quantum finite automata with a probability smaller than the corresponding probability for the preceding language in the hierarchy. These probabilities converge to 1/2.