Search results for "Complement"
showing 10 items of 2113 documents
Highly irregular graphs with extreme numbers of edges
1997
Abstract A simple connected graph is highly irregular if each of its vertices is adjacent only to vertices with distinct degrees. In this paper we find: (1) the greatest number of edges of a highly irregular graph with n vertices, where n is an odd integer (for n even this number is given in [1]), (2) the smallest number of edges of a highly irregular graph of given order.
A characterization of the Schur property through the disk algebra
2017
[EN] In this paper we give a new characterization of when a Banach space E has the Schur property in terms of the disk algebra. We prove that E has the Schur property if and only if A(D, E) = A(D,E-w). (C) 2016 Elsevier Inc. All rights reserved.
A general concept of fuzzy connectives, negations and implications based on t-norms and t-conorms
1983
All known connectives 'and'/'or' for fuzzy sets or some classes can be introduced as t-norms/t-conorms, where Ling's representation theorem is used as a basic tool, and which is illustrated by various known and new examples (Section 2). Given a strict negation function and one connective, the other can be constructed, so that the corresponding De Morgan law is valid. In case of given Archimedean connectives, there can be constructed negation functions (Section 3). Given a non-strict Archimedean connective, a negation function and the other connective can be constructed, so that in addition to the De Morgan laws, the excluded middle law and the law of non-contradiction are valid, i.e. the ne…
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…
Finite Soluble Groups with Permutable Subnormal Subgroups
2001
Abstract A finite group G is said to be a PST -group if every subnormal subgroup of G permutes with every Sylow subgroup of G . We shall discuss the normal structure of soluble PST -groups, mainly defining a local version of this concept. A deep study of the local structure turns out to be crucial for obtaining information about the global property. Moreover, a new approach to soluble PT -groups, i.e., soluble groups in which permutability is a transitive relation, follows naturally from our vision of PST -groups. Our techniques and results provide a unified point of view for T -groups, PT -groups, and PST -groups in the soluble universe, showing that the difference between these classes is…
Polynomial identities for the Jordan algebra of a degenerate symmetric bilinear form
2013
Let J(n) be the Jordan algebra of a degenerate symmetric bilinear form. In the first section we classify all possible G-gradings on J(n) where G is any group, while in the second part we restrict our attention to a degenerate symmetric bilinear form of rank n - 1, where n is the dimension of the vector space V defining J(n). We prove that in this case the algebra J(n) is PI-equivalent to the Jordan algebra of a nondegenerate bilinear form.
Convolution of three functions by means of bilinear maps and applications
1999
When dealing with spaces of vector-valued analytic functions there is a natural way to understand multipliers between them. If X and Y are Banach spaces and L(X,Y ) stands for the space of linear and continuous operators we may consider the convolution of L(X,Y )-valued analytic functions, say F (z) = ∑ n=0∞ Tnz , and X-valued polynomials, say f(z) = ∑m n=0 xnz , to get the Y -valued function F ∗ f(z) = ∑ Tn(xn)z. The second author considered such a definition and studied multipliers between H(X) and BMOA(Y ) in [5]. When the functions take values in a Banach algebra A then the natural extension of multiplier is simply that if f(z) = ∑ anz n and g(z) = ∑ bnz , then f ∗ g(z) = ∑ an.bnz n whe…
Relations between structure and estimators in networks of dynamical systems
2011
The article main focus is on the identification of a graphical model from time series data associated with different interconnected entities. The time series are modeled as realizations of stochastic processes (representing nodes of a graph) linked together via transfer functions (representing the edges of the graph). Both the cases of non-causal and causal links are considered. By using only the measurements of the node outputs and without assuming any prior knowledge of the network topology, a method is provided to estimate the graph connectivity. In particular, it is proven that the method determines links to be present only between a node and its “kins”, where kins of a node consist of …
Graph Connectivity, Monadic NP and built-in relations of moderate degree
1995
It has been conjectured [FSV93] that an existential secondoder formula, in which the second-order quantification is restricted to unary relations (i.e. a Monadic NP formula), cannot express Graph Connectivity even in the presence of arbitrary built-in relations.
Sylow numbers and nilpotent Hall subgroups
2013
Abstract Let π be a set of primes and G a finite group. We characterize the existence of a nilpotent Hall π-subgroup of G in terms of the number of Sylow subgroups for the primes in π.