Log in

Relevant bibliographies by topics / Somme des degrés / Journal articles

To see the other types of publications on this topic, follow the link: Somme des degrés.

Journal articles on the topic 'Somme des degrés'

Author: Grafiati

Published: 25 May 2024

Last updated: 31 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Somme des degrés.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Pontreau, Corentin. "Petits points d’une surface." Canadian Journal of Mathematics 61, no. 5 (2009): 1118–50. http://dx.doi.org/10.4153/cjm-2009-053-x.

Full text

Abstract:

Résumé. Pour toute sous-vari ét é géométriquement irréductible $V$ du groupe multiplicatif $\mathbb{G}_{m}^{n}$, on sait qu’en dehors d’un nombre fini de translat és de tores exceptionnels inclus dans $V$, tous les points sont de hauteur minorée par une certaine quantit é $q{{(V)}^{-1}}>0$. On conna ît de plus une borne supérieure pour la somme des degrés de ces translat és de tores pour des valeurs de $q(V)$ polynomiales en le degré de $V$. Ceci n’est pas le cas si l’on exige une minoration quasi-optimale pour la hauteur des points de $V$, essentiellement linéaire en l’inverse du degré.Nou

APA, Harvard, Vancouver, ISO, and other styles

2

Fauquant-Millet, Florence, and Anthony Joseph. "La somme des faux degrés—un mystère en théorie des invariants." Advances in Mathematics 217, no. 4 (2008): 1476–520. http://dx.doi.org/10.1016/j.aim.2007.10.002.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Hamdouch, Abdelillah. "Nature et Ville : L’impossible compromis?" Risco Revista de Pesquisa em Arquitetura e Urbanismo (Online) 18, no. 2 (2020): 1–13. http://dx.doi.org/10.11606/issn.1984-4506.v18i2p1-13.

Full text

Abstract:

L’histoire des relations entre nature et urbanisation est tout sauf un “long fleuve tranquille“. “Faire la ville“ a depuis les origines de l’urbanisation signifié utiliser, contrôler voire asservir la Nature (certes, à des degrés divers) pour les besoins de l’Homme se voyant désormais “urbain“. Cependant, jusqu’au début de l’industrialisation en Europe il y a un peu plus de deux siècles, l’intrusion de la ville dans la nature est restée somme toute mesurée, l’économie urbaine naissante dépendant encore très largement de ressources forestières, fluviales ou maritimes, et de productions agricole

APA, Harvard, Vancouver, ISO, and other styles

4

COLLIOT-THÉLÈNE, J. L., and A. N. SKOROBOGATOV. "Descent on fibrations over P1k revisited." Mathematical Proceedings of the Cambridge Philosophical Society 128, no. 3 (2000): 383–93. http://dx.doi.org/10.1017/s0305004199004077.

Full text

Abstract:

Soient k un corps de nombres et f: X → P1k un k-morphisme surjectif de k-variétés projectives lisses, à fibre générique géométriquement intègre. Supposons que les fibres de f au-dessus d'un sous-ensemble Hilbertien de P1(k) satisfont le principe de Hasse (resp. le principe de Hasse et l'approximation faible). Supposons que toutes les fibres géométriques de f ont au moins une composante de multiplicité un. Le rang de f est la somme des degrés des points fermés P dont la fibre XP = f−1(P) ne possède pas de composante de multiplicité un géométriquement intègre. Supposons le rang au plus égal à 2.

APA, Harvard, Vancouver, ISO, and other styles

5

Chambon, O., P. Cialdella, M. Marie-Cardine, and J. L. Terra. "Une voie de recherche en psychopathologie quantitative: présentation des travaux de P. Bech." Psychiatry and Psychobiology 4, no. 3 (1989): 133–38. http://dx.doi.org/10.1017/s0767399x00001553.

Full text

Abstract:

RésuméLes travaux de P. Bech sont principalement axés vers l’amélioration des qualités psychométriques des échelles d’évaluation psychiatrique déjá existantes. Dans ce but, P. Bech propose plusieurs techniques:– la plus importante, résidant dans l’utilisation du modéle logistique de Rasch: le modéle de Rasch permet de s’assurer, á l’encontre de l’analyse factorielle, de la valeur d’une somme de notes d’item en vue de la mesure d’une dimension. La position (paramétre) des item sur la dimension est estimée indépendamment de la population, et les estimations sont donc théoriquement absolues. Par

APA, Harvard, Vancouver, ISO, and other styles

6

Leckey, Robert. "Profane Matrimony." Canadian journal of law and society 21, no. 2 (2006): 1–23. http://dx.doi.org/10.1017/s0829320100008929.

Full text

Abstract:

RésuméLes débats récents concernant le mariage des couples de même sexe appellent à une réflexion plus large sur la rivalité entre les normes qui prétendent gouverner le mariage. Lors de ces débats, deux prétentions prirent l'avant-scène: l'une voulant que la loi suprême du mariage se trouve dans les traditions religieuses, et l'autre selon laquelle le mariage civil serait purement séculaire et trouverait sa loi suprême dans laCharte canadienne des droits et libertés. Cet article identifie certaines similarités au sein de ces deux prétentions. En particulier, chacune suppose erronément l'unifo

APA, Harvard, Vancouver, ISO, and other styles

7

Abdulwahab, Alahmari. "Academic radiology degrees in the British educational system." Academic radiology degrees in the British educational system 4, no. 1 (2021): 57–59. https://doi.org/10.36811/ojrmi.2021.110020.

Full text

Abstract:

The aim of this paper is to discribe some important academic degrees in radiology to make it a reference paper for students and applicants for degrees in radiology. Furthermore, to highlight some degrees in radiology many people are unfamiliar with these degrees. https://www.raftpubs.com/ojrmi-radiology-and-medical-imaging/articles/ojrmi_raft1020.php  

APA, Harvard, Vancouver, ISO, and other styles

8

Ouellet, Fernand. "L'échec du mouvement insurrectionnel, 1837-1839." Articles 6, no. 2 (2005): 135–61. http://dx.doi.org/10.7202/055264ar.

Full text

Abstract:

Le mouvement insurrectionnel de 1837-38 a été interprété de multiples façons. Certains historiens y ont vu le fruit d'une poussée subite de colère et d'indignation, évidemment non préméditée, qui aurait été déclenchée par les résolutions de Lord Russell qui violaient un principe constitutionnel. Cette vue des choses nous paraît assez peu conforme à la mentalité canadienne-française. Le recours spontané aux armes n'a jamais été le moyen de prédilection utilisé par les Canadiens français pour réaliser leurs objectifs collectifs ou pour faire valoir leurs réclamations. La Fontaine qui les connais

APA, Harvard, Vancouver, ISO, and other styles

9

Swamy CS, Shivakumar. "Minimum Degree Energy for Some Classes of Graphs." International Journal of Science and Research (IJSR) 8, no. 1 (2019): 2276–80. http://dx.doi.org/10.21275/sr19116145237.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Swamy CS, Shivakumar. "Minimum Degree Energy for Some Classes of Graphs." International Journal of Science and Research (IJSR) 12, no. 1 (2023): 1066–71. http://dx.doi.org/10.21275/sr23110124059.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Radha, K., and S. R. Gayathri. "Distance Degree Sequence and Distance Neighborhood Degree Sequence of Vertices in Fuzzy Graphs and Some of Their Properties." Indian Journal Of Science And Technology 17, no. 41 (2024): 4349–57. http://dx.doi.org/10.17485/ijst/v17i41.1933.

Full text

Abstract:

Objectives: The objective of this study is to explore new types of sequences in fuzzy graphs namely distance degree sequence and distance neighborhood degree sequence of fuzzy graphs which may have various applications in the real world. Methods: In this paper, two unique sequences for each vertex of fuzzy graphs are given by means of its degree and neighborhood degree which are called as the distance degree sequence and distance neighborhood degree sequence of vertices of fuzzy graphs respectively. The n-tuple of the distance degree sequence of vertices of a fuzzy graph arranged in lexicograp

APA, Harvard, Vancouver, ISO, and other styles

12

Sakthi, K. Aruna, and R. Rajeswari. "On Distance Average Degree Independent Resolving Sets of Some Algebraic Graphs." Indian Journal Of Science And Technology 17, no. 21 (2024): 2250–54. http://dx.doi.org/10.17485/ijst/v17i21.1362.

Full text

Abstract:

Objectives: This study introduces the concept of distance average degree independent resolving sets and its dimensions for identity graphs of finite groups and order prime graphs of finite groups as a theorem in detail. Methods: The methodology involves first constructing the subset from the given graph, then finding the distance between each and every vertice of the graph and the subset, and also finding the average of the distance such that each and every vertice should receive a distinct code. The minimum number of vertices that satisfy this condition, their cardinality, is called the dimen

APA, Harvard, Vancouver, ISO, and other styles

13

Ding, Lei, Syed Ahtsham Ul Haq Bokhary, Masood Ur Rehman, et al. "Degree-Based Indices of Some Complex Networks." Journal of Mathematics 2021 (March 17, 2021): 1–16. http://dx.doi.org/10.1155/2021/5531357.

Full text

Abstract:

A topological index is a numeric quantity assigned to a graph that characterizes the structure of a graph. Topological indices and physico-chemical properties such as atom-bond connectivity ABC , Randić, and geometric-arithmetic index GA are of great importance in the QSAR/QSPR analysis and are used to estimate the networks. In this area of research, graph theory has been found of considerable use. In this paper, the distinct degrees and degree sums of enhanced Mesh network, triangular Mesh network, star of silicate network, and rhenium trioxide lattice are listed. The edge partitions of these

APA, Harvard, Vancouver, ISO, and other styles

14

Chems-Eddin, Mohamed Mahmoud, Abdelmalek Azizi, and Abdelkader Zekhnini. "On the $2$-class group of some number fields with large degree." Archivum Mathematicum, no. 1 (2021): 13–26. http://dx.doi.org/10.5817/am2021-1-13.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Pegu, Aditya, Sumanta Borah, and Ankur Bharali. "Predictive Ability of Some Neighborhood Degree-Based Topological Indices for Antituberculosis Drugs." Indian Journal Of Science And Technology 16, no. 26 (2023): 1986–96. http://dx.doi.org/10.17485/ijst/v16i26.615.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Braddon-Mitchell, David, and Kristie Miller. "Surviving, to some degree." Philosophical Studies 177, no. 12 (2020): 3805–31. http://dx.doi.org/10.1007/s11098-019-01410-0.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

A. Anu. "Degree Associated Reconstruction Number of Split Graphs with Some Biregular Independent Set." Communications on Applied Nonlinear Analysis 32, no. 8s (2025): 888–92. https://doi.org/10.52783/cana.v32.3881.

Full text

Abstract:

A vertex-deleted subgraph of a graph G with which the degree of the deleted vertex is given is called a degree associated card of G. The degree associated reconstruction number (or drn) of a graph G is the size of the smallest collection of the degree associated cards of G that uniquely determines G. A split graph G is a graph in which the vertices can be partitioned into an independent set and a clique. We prove that the drn is 1 or 2 for all split graphs G of order at least seven in which all the vertices in the independent set have degrees r and s whose distinct degrees differ by at least t

APA, Harvard, Vancouver, ISO, and other styles

18

Härmä, Juhani. "Dislocation et topicalisation : degrés de grammaticalisation." Verbum 25, no. 3 (2003): 381–90. https://doi.org/10.3406/verbu.2003.1750.

Full text

Abstract:

Changes in constituent order have not always been considered as pertaining to the study of grammaticalization. This article purports to examine some constructions from that point of view. The discussion focuses on dislocation or detachment, which occurs with variable frequencies in different languages. In addition, some observations are made on topicalization. Both structures imply the anteposition of a postverbal constituent, with or without a pronominal copy. In addition to French, a brief survey includes Spanish, Italian, English, Swedish and Finnish. It can be concluded that Romance langua

APA, Harvard, Vancouver, ISO, and other styles

19

Al-Odhari, Adel. "Some Aspects of Neutrosophic Set Theory." Neutrosophic Optimization and Intelligent Systems 4 (October 1, 2024): 31–38. http://dx.doi.org/10.61356/j.nois.2024.4359.

Full text

Abstract:

This article aims to introduce my work on constructing neutrosophic set theory. Neutrosophy is a new branch of mathematical systems proposed by Smarandache in 1995 as an extension of an intuitionistic fuzzy set according to three-degree membership functions. The new perspective of neutrosophic sets consists of two paths, the first path depends on the three degrees including the degree of truth-membership, degree of indeterminacy-membership, and degree of false-non-membership respectively, while the second path depends on the generated classical set by three types of neutrosophic sets and study

APA, Harvard, Vancouver, ISO, and other styles

20

Jaszczolt, Katarzyna M. "temps comme degrés d'engagement épistémique." Travaux neuchâtelois de linguistique, no. 51 (January 1, 2011): 97–113. http://dx.doi.org/10.26034/tranel.2011.2773.

Full text

Abstract:

This article addresses the question as to whether time is a primitive concept or rather is composed of conceptually more basic building blocks. After a brief analysis of tense-time mismatches with examples from English, Polish, Thai and Swahili, I present a hypothesis that time is conceptualized in terms of degrees of epistemic modality. Expressions with future, present and past reference are ordered on scales of epistemic commitment. I demonstrate that the theory of Default Semantics has no difficulty with representing tense-time mismatches in that it reflects the fact that information about

APA, Harvard, Vancouver, ISO, and other styles

21

Cheng, Xin, and Xueliang Li. "Some Bounds for the Vertex Degree Function Index of Connected Graphs with Given Minimum and Maximum Degrees." Match Communications in Mathematical and in Computer Chemistry 90, no. 1 (2023): 175–86. http://dx.doi.org/10.46793/match.90-1.175c.

Full text

Abstract:

This paper gives some bounds for the vertex degree function index Hf(G) in terms of the order and size of a graph G, where G is a simple, finite and connected graph with minimum degree δ and maximum degree ∆. Some families of graphs are also constructed to show that the bounds can be achieved.

APA, Harvard, Vancouver, ISO, and other styles

22

Stephan, Frank. "On the structures inside truth-table degrees." Journal of Symbolic Logic 66, no. 2 (2001): 731–70. http://dx.doi.org/10.2307/2695042.

Full text

Abstract:

AbstractThe following theorems on the structure inside nonrecursive truth-table degrees are established: Dëgtev's result that the number of bounded truth-table degrees inside a truth-table degree is at least two is improved by showing that this number is infinite. There are even infinite chains and antichains of bounded truth-table degrees inside every truth-table degree. The latter implies an affirmative answer to the following question of Jockusch: does every truth-table degree contain an infinite antichain of many-one degrees? Some but not all truth-table degrees have a least bounded truth-

APA, Harvard, Vancouver, ISO, and other styles

23

Virk, Abaid ur Rehman, and Muhammad Quraish. "Some Invariants of Flower Graph." Applied Mathematics and Nonlinear Sciences 3, no. 2 (2018): 427–32. http://dx.doi.org/10.21042/amns.2018.2.00033.

Full text

Abstract:

AbstractLet G be a graph and let mij(G), i, j ≥ 1, represents the number of edge of G, where i and j are the degrees of vertices u and v respectively. In this article, we will compute different polynomials of flower graph f(n×m), namely M polynomial and Forgotten polynomial. These polynomials will help us to find many degree based topological indices, included different Zagreb indices, harmonic indices and forgotten index.

APA, Harvard, Vancouver, ISO, and other styles

24

Toca, Alexei, Vadim Iaţchevici, Tatiana Niţulenco, and Nicolae Rusu. "Some aspects of technology transfer." MATEC Web of Conferences 178 (2018): 08006. http://dx.doi.org/10.1051/matecconf/201817808006.

Full text

Abstract:

Technological transfer is a complex and varied process, being realized out at different stages of technology readiness level. Being essentially a trading, technology transfer is fully subject to market laws. The technology transfer strategy and tactics are strongly influenced by the degree of technology's readiness level, systemic character, functional orientation and universality, technical and economic determination degrees that can be specified and determined in accordance with the stages of technology life cycle.

APA, Harvard, Vancouver, ISO, and other styles

25

Aziziheris, Kamal, and Mohammad Hosein Salmani Yengejeh. "Some solvable character degree sets." Communications in Algebra 45, no. 10 (2016): 4283–91. http://dx.doi.org/10.1080/00927872.2016.1262389.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Amin, Shahid, M. A. Rehman, Amir Naseem, Ilyas Khan, Nawa Alshammari, and Nawaf N. Hamadneh. "Analysis of Complex Networks via Some Novel Topological Indices." Mathematical Problems in Engineering 2022 (April 29, 2022): 1–13. http://dx.doi.org/10.1155/2022/9040532.

Full text

Abstract:

Chemical graph theory is a field of mathematical chemistry that links mathematics, chemistry, and graph theory to solve chemistry-related issues quantitatively. Mathematical chemistry is an area of mathematics that employs mathematical methods to tackle chemical-related problems. A graphical representation of chemical molecules, known as the molecular graph of the chemical substance, is one of these tools. A topological index (TI) is a mathematical function that assigns a numerical value to a (molecular) graph and predicts many physical, chemical, biological, thermodynamical, and structural fe

APA, Harvard, Vancouver, ISO, and other styles

27

Byrne, Graeme J., and Simon J. Smith. "Some integer-valued trigonometric sums." Proceedings of the Edinburgh Mathematical Society 40, no. 2 (1997): 393–401. http://dx.doi.org/10.1017/s001309150002383x.

Full text

Abstract:

It is shown that for m = 1,2,3,…, the trigonometric sums and can be represented as integer-valued polynomials in n of degrees 2m – 1 and 2m, respectively. Properties of these polynomials are discussed, and recurrence relations for the coefficients are obtained. The proofs of the results depend on the representations of particular polynomials of degree n – 1 or less as their own Lagrange interpolation polynomials based on the zeros of the nth Chebyshev polynomial Tn(x) = cos(narccos x), -1≤x≤1.

APA, Harvard, Vancouver, ISO, and other styles

28

Özalan, Nurten Urlu. "Some Indices over a New Algebraic Graph." Journal of Mathematics 2021 (April 16, 2021): 1–8. http://dx.doi.org/10.1155/2021/5510384.

Full text

Abstract:

In this paper, we first introduce a new graph Γ N over an extension N of semigroups and after that we study and characterize the spectral properties such as the diameter, girth, maximum and minimum degrees, domination number, chromatic number, clique number, degree sequence, irregularity index, and also perfectness for Γ N . Moreover, we state and prove some important known Zagreb indices on this new graph.

APA, Harvard, Vancouver, ISO, and other styles

29

Lacroix, Benoît. "Imaginaire, merveilleux et sacré avec Jean-Charles Falardeau." Recherches sociographiques 23, no. 1-2 (2005): 109–24. http://dx.doi.org/10.7202/055976ar.

Full text

Abstract:

Au moment où nous rédigeons ces pages, à deux décades près de l'an deux mille, Freud a déjà réhabilité le rêve, Breton l'instinct, Durand l'imaginaire, Mabille le merveilleux, Todorov le fantastique ; Otto, Bataille, Caillois, les historiens Éliade et Dumézil ont réévalué depuis longtemps le sacré et le religieux. Jean-Charles Falardeau écoute ces « maîtres » avec un talent critique dont nous voudrions rendre compte ici pour mieux nous interroger avec lui sur d'autres perspectives possibles de l'étude du phénomène religieux dans le milieu canadien-français. Rappeler ce qui, à notre point de vu

APA, Harvard, Vancouver, ISO, and other styles

30

Manju, V. N., T. B. Athul, and G. Suresh Singh. "SOME BOUNDS FOR THE WIENER INDEX OF WEAK JOIN OF TWO GRAPHS." Advances in Mathematics: Scientific Journal 12, no. 1 (2023): 107–13. http://dx.doi.org/10.37418/amsj.12.1.7.

Full text

Abstract:

In 2020, G. Suresh Singh and Manju V. N. \cite{mvn} introduced the concept of weak join of two disjoint graphs with respect to the degrees of the given graphs and categorized them as homogeneous weak join, heterogeneous weak join and studied some of their properties. Homogeneous weak join can be splitted in to three cases namely, odd to odd degree weak join, even to even degree weak join, odd to odd and even to even degree weak join. Similarly, heterogeneous weak join includes the other three cases namely, odd to even degree weak join, even to odd degree weak join, odd to even and even to odd

APA, Harvard, Vancouver, ISO, and other styles

31

Delen, Sadik, Musa Demirci, Ahmet Sinan Cevik, and Ismail Naci Cangul. "On Omega Index and Average Degree of Graphs." Journal of Mathematics 2021 (November 12, 2021): 1–5. http://dx.doi.org/10.1155/2021/5565146.

Full text

Abstract:

Average degree of a graph is defined to be a graph invariant equal to the arithmetic mean of all vertex degrees and has many applications, especially in determining the irregularity degrees of networks and social sciences. In this study, some properties of average degree have been studied. Effect of vertex deletion on this degree has been determined and a new proof of the handshaking lemma has been given. Using a recently defined graph index called o m e g a index, average degree of trees, unicyclic, bicyclic, and tricyclic graphs have been given, and these have been generalized to k -cyclic g

APA, Harvard, Vancouver, ISO, and other styles

32

Fischer, Paul. "Pairs without infimum in the recursively enumerable weak truth table degrees." Journal of Symbolic Logic 51, no. 1 (1986): 117–29. http://dx.doi.org/10.2307/2273948.

Full text

Abstract:

wtt-reducibility has become of some importance in the last years through the works of Ladner and Sasso [1975], Stob [1983] and Ambos-Spies [1984]. It differs from Turing reducibility by a recursive bound on the use of the reduction. This makes some proofs easier in the wtt degrees than in the Turing degrees. Certain proofs carry over directly from the Turing to the wtt degrees, especially those based on permitting. But the converse is also possible. There are some r.e. Turing degrees which consist of a single r.e. wtt degree (the so-called contiguous degrees; see Ladner and Sasso [1975]). Thus

APA, Harvard, Vancouver, ISO, and other styles

33

Schmidt, Frank, Louis W. Shapiro, Stephen M. Gagola, and B. Huppert. "Characterization of Some Character Degrees: 10458." American Mathematical Monthly 105, no. 9 (1998): 861. http://dx.doi.org/10.2307/2589227.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Cintioli, Patrizio. "Cone Avoidance of Some Turing Degrees." Journal of Mathematics Research 9, no. 4 (2017): 69. http://dx.doi.org/10.5539/jmr.v9n4p69.

Full text

Abstract:

We study the cone avoidance and the upper cone avoidance of two substructures of m-introimmune Turing degrees. We show that the substructure of the m-introimmune Turing degrees satisfies the cone avoidance property, and that the substructure of the computably enumerable m-introimmune Turing degrees satisfies the upper cone avoidance property.

APA, Harvard, Vancouver, ISO, and other styles

35

S, Ramakrishnan. "Degree Distance of Some Planar Graphs." INTERNATIONAL JOURNAL OF COMPUTING ALGORITHM 3, no. 1 (2014): 54–57. http://dx.doi.org/10.20894/ijcoa.101.003.001.014.

Full text

APA, Harvard, Vancouver, ISO, and other styles

36

Hamzeh, Asma, Ali Iranmanesh, and Samaneh Hossein-Zadeh. "Some Results on Generalized Degree Distance." Open Journal of Discrete Mathematics 03, no. 03 (2013): 143–50. http://dx.doi.org/10.4236/ojdm.2013.33026.

Full text

APA, Harvard, Vancouver, ISO, and other styles

37

Bailey, Colin G. "Some new natural α-re-degrees". Journal of Symbolic Logic 52, № 1 (1987): 227–31. http://dx.doi.org/10.2307/2273879.

Full text

Abstract:

AbstractIf α is a singular cardinal (either real or fake) in L, I exhibit many natural α-re subsets, defined uniformly from the ⊿1 subsets of a. If α. is a true cardinal this provides an uppersemilattice (usl) embedding from the lattice of ⊿1 subsets of α into the usl of α-re-degrees. It will also be shown that this embedding cannot be extended to the Σ1 subsets of α.

APA, Harvard, Vancouver, ISO, and other styles

38

Omanadze, Roland Sh. "Some structural properties of quasi-degrees." Logic Journal of the IGPL 26, no. 1 (2017): 191–201. http://dx.doi.org/10.1093/jigpal/jzx058.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

Aziziheris, Kamal. "Some character degree sets implying nonsolvability." Journal of Pure and Applied Algebra 224, no. 4 (2020): 106218. http://dx.doi.org/10.1016/j.jpaa.2019.106218.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

HADWIN, DON, and WEIHUA LI. "THE SIMILARITY DEGREE OF SOME -ALGEBRAS." Bulletin of the Australian Mathematical Society 89, no. 1 (2013): 60–69. http://dx.doi.org/10.1017/s0004972713000543.

Full text

Abstract:

AbstractWe define the class of weakly approximately divisible unital${C}^{\ast } $-algebras and show that this class is closed under direct sums, direct limits, any tensor product with any${C}^{\ast } $-algebra, and quotients. A nuclear${C}^{\ast } $-algebra is weakly approximately divisible if and only if it has no finite-dimensional representations. We also show that Pisier’s similarity degree of a weakly approximately divisible${C}^{\ast } $-algebra is at most five.

APA, Harvard, Vancouver, ISO, and other styles

41

Baker, C. L. "Some observations on degree of learnability." Behavioral and Brain Sciences 12, no. 2 (1989): 334–35. http://dx.doi.org/10.1017/s0140525x00048895.

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

Tong-Viet, Hung P. "Some conjectures on Brauer character degrees." Journal of Algebra 550 (May 2020): 210–18. http://dx.doi.org/10.1016/j.jalgebra.2020.01.008.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

AYTAÇ, AYSUN, and HANIFE AKSU. "SOME RESULTS FOR THE RUPTURE DEGREE." International Journal of Foundations of Computer Science 24, no. 08 (2013): 1329–38. http://dx.doi.org/10.1142/s0129054113500366.

Full text

Abstract:

The rupture degree of an incomplete connected graph G is defined by[Formula: see text] where w(G − S) denotes the number of components in the graph G − S and m(G − S) is the order of the largest component of G − S. This parameter can be used to measure the vulnerability of a graph. In this paper, some bounds consisted of the relationships between the rupture degree and some vulnerability parameters on the rupture degree of a graph are given.

APA, Harvard, Vancouver, ISO, and other styles

44

Hernández-Gutiérrez, Rodrigo, and Verónica Martínez-de-la-Vega. "Homogeneity degree of some symmetric products." Topology and its Applications 230 (October 2017): 276–82. http://dx.doi.org/10.1016/j.topol.2017.08.027.

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

Dutta, Parama, and Rajat Kanti Nath. "Some bounds for relative autocommutativity degree." Proyecciones (Antofagasta) 39, no. 3 (2020): 679–92. http://dx.doi.org/10.22199/issn.0717-6279-2020-03-0042.

Full text

APA, Harvard, Vancouver, ISO, and other styles

46

Kalimullin, I. Sh. "Spectra of degrees of some structures." Algebra and Logic 46, no. 6 (2007): 399–408. http://dx.doi.org/10.1007/s10469-007-0039-6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

Rose, Amy D. "The individualized bachelor's degree: Some reconsiderations." Innovative Higher Education 13, no. 1 (1988): 38–46. http://dx.doi.org/10.1007/bf00898130.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

Nath, Rajat Kanti, and Manoj Kumar Yadav. "Some results on relative commutativity degree." Rendiconti del Circolo Matematico di Palermo (1952 -) 64, no. 2 (2015): 229–39. http://dx.doi.org/10.1007/s12215-015-0194-x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

Yuefei, Sui. "Some results about the R.E. degrees." Acta Mathematica Sinica 3, no. 2 (1987): 170–79. http://dx.doi.org/10.1007/bf02565029.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

Bell, R. T., and E. H. Robson. "Some remarks on data processing degrees." ITNOW 28, no. 4 (1986): 26–29. https://doi.org/10.1093/combul/28.4.26.

Full text

Abstract:

Abstract It is over a decade since a working party (chaired by Professor F. Land) on Degrees in Data Processing was established by The British Computer Society. This was done in response to a perceived need for specialised courses aimed at preparing young men and women for careers connected with the design and implementation of computer-based information systems for management. A report [1] giving detailed proposals for the structure and syllabus content of first degree courses in data processing was published in 1975. The authors of the report acknowledged that by then the use of computers to

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!