Search results for "NUMB"
showing 10 items of 3956 documents
The expansion $\star$ mod $\bar{o}(\hbar^4)$ and computer-assisted proof schemes in the Kontsevich deformation quantization
2019
The Kontsevich deformation quantization combines Poisson dynamics, noncommutative geometry, number theory, and calculus of oriented graphs. To manage the algebra and differential calculus of series of weighted graphs, we present software modules: these allow generating the Kontsevich graphs, expanding the noncommutative & x22c6;-product by using a priori undetermined coefficients, and deriving linear relations between the weights of graphs. Throughout this text we illustrate the assembly of the Kontsevich & x22c6;-product up to order 4 in the deformation parameter Already at this stage, the & x22c6;-product involves hundreds of graphs; expressing all their coefficients via 149 w…
IN service specification using the KANNEL language
1995
KANNEL is an application-oriented language for protocol engineering, with integrated support for all the main aspects of implementing typical communications software. Intelligent network services with distributed and interacting components share a number of central features with communications protocols, thus bringing in the possibility of applying protocol engineering techniques within the area of intelligent networking. To verify this view, the KANNEL language is applied to the specification of an intelligent calling card service. The specification includes both visual and textual notations of KANNEL.
Analyse von Hilfeersuchen
1994
There is no doubt that a single emergency phone number is desirable, but in contrast to other countries, in Germany different emergency phone numbers and dispatching centers exist for the fire brigade (FB), the emergency medical service system (EMS), and the general practitioners' emergency service (GPS). Due to this fact, valuable time is often wasted by connecting or transferring emergency calls from one dispatching center to another. The purpose of this study was to analyse all calls received by the different dispatching centers in the city and county area of Mainz with respect to total number, fraction of emergency calls, and specificity. Further, the total number of calls potentially r…
Semidirect products of internal groupoids
2010
We give a characterization of those finitely complete categories with initial object and pushouts of split monomorphisms that admit categorical semidirect products. As an application we examine the case of groupoids with fixed set of objects. Further, we extend this to the internal case. (C) 2010 Elsevier B.V. All rights reserved.
Degrees of characters in the principal block
2021
Abstract Let G be a finite group. We prove that if the set of degrees of characters in the principal p-block of G has size at most 2 then G is p-solvable, and G / O p ′ ( G ) has a metabelian normal Sylow p-subgroup. The general question of proving that if an arbitrary p-block has two degrees then their defect groups are metabelian remains open.
Kontsevich–Zagier Periods
2017
We compare the set of Kontsevich–Zagier periods defined by integrals over semi-algebraic subsets of \(\mathbb {R}^n\) with cohomological periods.
Binary Patterns in Infinite Binary Words
2002
In this paper we study the set P(w) of binary patterns that can occur in one infinite binary word w, comparing it with the set F(w) of factors of the word. Since the set P(w) can be considered as an extension of the set F(w), we first investigate how large is such extension, by introducing the parameter ?(w) that corresponds to the cardinality of the difference set P(w) \ F(w). Some non trivial results about such parameter are obtained in the case of the Thue-Morse and the Fibonacci words. Since, in most cases, the parameter ?(w) is infinite, we introduce the pattern complexity of w, which corresponds to the complexity of the language P(w). As a main result, we prove that there exist infini…
Bernstein sets andκ-coverings
2010
䅢stract. In this paper we study a notion of a �-covering in connection with Bernstein sets and other types of nonmeasurability. Our results correspond to those obtained by Muthuvel in [7] and Nowik in [8]. We consider also other types of coverings. 1. Definitions and notation In 1993 Car汳on 楮 h楳 paper 嬳] 楮troduced a not楯n of �-cover楮gs and used 楴 for 楮vest楧at楮g whether some 楤ea汳 are or are not �-trans污tab汥. Later on �-cover楮gs were stud楥d by other authors, e. Muthuvel (cf. [7 崩 and Now楫 (cf. 嬸崬 嬹崩. In th楳 paper we present new resu汴s on �-cover楮gs 楮 connect楯n w楴h Bernste楮 sets. We a汳o 楮troduce two natural genera汩zat楯ns of the not楯n of �-cover楮gs, name汹 �-S-cover楮gs and �-I-cover楮gs. We use …
The set of conjugacy class sizes of a finite group does not determine its solvability
2014
Abstract We find a pair of groups, one solvable and the other non-solvable, with the same set of conjugacy class sizes.
Maximal subgroups and formations
1989
Abstract We define, in each finite group G , some subgroups of Frattini-type in relation with a saturated formation and with a set of primes and study their properties, especially their influence in the structure of G .