Results 241 to 250 of about 84,298 (262)
Some of the next articles are maybe not open access.
On the Periodicity of Lucas-Balancing Numbers and p-adic Order of Balancing Numbers
Iranian Journal of Science and Technology, Transactions A: Science, 2020The objective of this article is to study the periodicity of Lucas-balancing numbers modulo any positive integer. Some relations between the periodicity of balancing and Lucas-balancing numbers are also discussed. Further, in this study the p-adic order of balancing numbers is completely characterized .
Takao Komatsu +2 more
openaire +1 more source
The maximum number of balancing sets
Graphs and Combinatorics, 1987Let \(a_ 1,...,a_ n\) be a sequence of nonzero real numbers such that \(\sum^{n}_{i=1}a_ i=0\). B is called a balancing set if \(\sum_{b\in B}a_ b=0\). Let f(n) be the maximum number of balancing sets. It is shown that \(f(n)=\left( \begin{matrix} 2k\\ k\end{matrix} \right)\) if \(n=2k\) and \(f(n)=2\left( \begin{matrix} 2k\\ k-1\end{matrix} \right ...
openaire +1 more source
The Balanced Decomposition Number and Vertex Connectivity
SIAM Journal on Discrete Mathematics, 2010Summary: The balanced decomposition number \(f(G)\) of a graph \(G\) was introduced by \textit{S. Fujita} and \textit{T. Nakamigawa} [Discrete Appl. Math. 156, No. 18, 3339--3344 (2008; Zbl 1178.05075)]. A balanced coloring of a graph \(G\) is a coloring of some of the vertices of \(G\) with two colors, such that there is the same number of vertices in
Shinya Fujita 0001, Henry Liu
openaire +1 more source
INCOMPLETE BALANCING AND LUCAS-BALANCING NUMBERS
2018The aim of this article is to establish some combinatorial expressions of balancing and Lucas-balancing numbers and investigate some of their properties.
Patel, Bijan Kumar +2 more
openaire +3 more sources
The number oft-wise balanced designs
Combinatorica, 1991This paper provides asymptotically the number of \(t\)-wise balanced designs and the number of \(t\)-profiles. If these numbers are indicated by \(N_ t(n)\) and \(P_ t(n)\), respectively, then the authors show that \[ N_ t(n)=n^{[{n\choose t}/(t+1)](1+o(1))} \] and \[ \exp(c_ 1\sqrt n\log n)\leq P_ t(n)\leq\exp(c_ 2\sqrt n\log n) \] where \(o(1)\) is ...
Charles J. Colbourn +4 more
openaire +2 more sources
Ars Combinatoria
Behera and Panda defined a balancing number as a number b for which the sum of the numbers from 1 to b – 1 is equal to the sum of the numbers from b + 1 to b + r for some r. They also classified all such numbers. We define two notions of balancing numbers for Farey fractions and enumerate all possible solutions.
Noah Lebowitz-Lockard, Joseph Vandehey
openaire +1 more source
Behera and Panda defined a balancing number as a number b for which the sum of the numbers from 1 to b – 1 is equal to the sum of the numbers from b + 1 to b + r for some r. They also classified all such numbers. We define two notions of balancing numbers for Farey fractions and enumerate all possible solutions.
Noah Lebowitz-Lockard, Joseph Vandehey
openaire +1 more source
New Hybrid Numbers with Balancing and Lucas-Balancing Number Components
2023Nurkan, Semra +3 more
openaire +1 more source
Analysis of an Active Charge Balancing Method Based on a Single Nonisolated DC/DC Converter
IEEE Transactions on Industrial Electronics, 2021Manuel Raeber, Djaffar Ould Abdeslam
exaly
On t-Balancers, t-Balancing Numbers and Lucas t-Balancing Numbers
2021Aydın, Samet, Tekcan, Ahmet
openaire +1 more source