ﻻ يوجد ملخص باللغة العربية
In 1972, Chvatal gave a well-known sufficient condition for a graphical sequence to be forcibly hamiltonian, and showed that in some sense his condition is best possible. Nash-Williams gave examples of forcibly hamiltonian n-sequences that do not satisfy Chvatlas condition for every n at least 5. In this note we generalize the Nash-Williams examples, and use this generalization to generate Omega(2^n/n^.5) forcibly hamiltonian n-sequences that do not satisfy Chvatals condition
In this paper we introduce and study the class of d-ball packings arising from edge-scribable polytopes. We are able to generalize Apollonian disk packings and the well-known Descartes theorem in different settings and in higher dimensions. After int
Let $n$ be a positive integer. In 1915, Theisinger proved that if $nge 2$, then the $n$-th harmonic sum $sum_{k=1}^nfrac{1}{k}$ is not an integer. Let $a$ and $b$ be positive integers. In 1923, Nagell extended Theisingers theorem by showing that the
Caratheodory showed that $n$ complex numbers $c_1,...,c_n$ can uniquely be written in the form $c_p=sum_{j=1}^m rho_j {epsilon_j}^p$ with $p=1,...,n$, where the $epsilon_j$s are different unimodular complex numbers, the $rho_j$s are strictly positive
In this paper, we will generalize the definition of partially random or complex reals, and then show the duality of random and complex, i.e., a generalized version of Levin-Schnorrs theorem. We also study randomness from the view point of arithmetic
In this paper we first prove a version of $L^{2}$ existence theorem for line bundles equipped a singular Hermitian metrics. Aa an application, we establish a vanishing theorem which generalizes the classical Nadel vanishing theorem.