On graphs whose reduced energy does not exceed 3.
Lazić, Mirjana (2005)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
Displaying similar documents to “The Friendship Theorem”
On graphs whose reduced energy does not exceed 3.
Stability of n -Bit Generalized Full Adder Circuits (GFAs). Part II
Katsumi Wasaki (2008)
Formalized Mathematics
Similarity:
We continue to formalize the concept of the Generalized Full Addition and Subtraction circuits (GFAs), define the structures of calculation units for the Redundant Signed Digit (RSD) operations, then prove its stability of the calculations. Generally, one-bit binary full adder assumes positive weights to all of its three binary inputs and two outputs. We define the circuit structure of two-types n-bit GFAs using the recursive construction to use the RSD arithmetic logical units that...
On the compressed Descartes-plane and its applications.
Szalay, I. (2001)
Acta Mathematica Academiae Paedagogicae Nyí regyháziensis. New Series [electronic only]
Similarity:
Bertrand’s Ballot Theorem
Karol Pąk (2014)
Formalized Mathematics
Similarity:
In this article we formalize the Bertrand’s Ballot Theorem based on [17]. Suppose that in an election we have two candidates: A that receives n votes and B that receives k votes, and additionally n ≥ k. Then this theorem states that the probability of the situation where A maintains more votes than B throughout the counting of the ballots is equal to (n − k)/(n + k). This theorem is item #30 from the “Formalizing 100 Theorems” list maintained by Freek Wiedijk at http://www.cs.ru.nl/F.Wiedijk/100/. ...
Arithmetical transfinite induction and hierarchies of functions
Z. Ratajczyk (1992)
Fundamenta Mathematicae
Similarity:
We generalize to the case of arithmetical transfinite induction the following three theorems for PA: the Wainer Theorem, the Paris-Harrington Theorem, and a version of the Solovay-Ketonen Theorem. We give uniform proofs using combinatorial constructions.
Pseudodual grids and extensions of generalized quadrangles.
Makhnev, A.A. (2001)
Sibirskij Matematicheskij Zhurnal
Similarity:
Antichains in the homomorphism order of graphs
Dwight Duffus, Peter, L. Erdös, Jaroslav Nešetřil, Lajos Soukup (2007)
Commentationes Mathematicae Universitatis Carolinae
Similarity:
Let and , respectively, denote the partially ordered sets of homomorphism classes of finite undirected and directed graphs, respectively, both ordered by the homomorphism relation. Order theoretic properties of both have been studied extensively, and have interesting connections to familiar graph properties and parameters. In particular, the notion of a duality is closely related to the idea of splitting a maximal antichain. We construct both splitting and non-splitting infinite maximal...
On the theory of grossone.
Gutman, A.E., Kutateladze, S.S. (2008)
Sibirskij Matematicheskij Zhurnal
Similarity:
Graphs and models with finite chains.
Nurtazin, A.T. (2007)
Sibirskie Ehlektronnye Matematicheskie Izvestiya [electronic only]
Similarity:
Littelmann's refined Demazure character formula revisited.
Ryom-Hansen, Steen (2002)
Séminaire Lotharingien de Combinatoire [electronic only]
Similarity:
Some Operations on Quaternion Numbers
Bo Li, Xiquan Liang, Pan Wang, Yanping Zhuang (2009)
Formalized Mathematics
Similarity:
In this article, we give some equality and basic theorems about quaternion numbers, and some special operations.