175,455 research outputs found
Joshua Davis: Author of Spare Parts
No full textCitation: K-State First (2016). Joshua Davis: Author of Spare Parts [Flier]. Manhattan, Kansas: K-State First.Flyer advertising Joshua Davis's author talk at Kansas State University
k-Oresme Numbers and k-Oresme Numbers with Negative Indices
No full text3rd International Conference on Mathematics and its Applications in Science and Engineering, ICMASE 2022 -- 4 July 2022 through 7 July 2022 -- 291239In this study, we gave some properties and identities for k-Oresme numbers which is a generalization of well-known number sequence called Oresme numbers. We considered and analyzed the k-Oresme numbers with negative indices. By defining the generating matrix of these numbers and using some matrix and determinant properties, we deduced some important identities. We also examined the sums of alternating, odd and even terms of k-Oresme numbers and sums of negative-indexed k-Oresme numbers. © 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG
Steven Johnson Author Talk Poster
No full textK-State Book NetworkA poster advertising an author talk by Steven Johnson at Kansas State University on September 3, 2014. Steven Johnson's book "The Ghost Map" was the 2014-2015 common book
Fermat -Fibonacci and -Lucas numbers
No full textsummary:Using the lower bound of linear forms in logarithms of Matveev and the theory of continued fractions by means of a variation of a result of Dujella and Pethő, we find all -Fibonacci and -Lucas numbers which are Fermat numbers. Some more general results are given
Some interpretations of the -Fibonacci numbers
No full textsummary:In this paper we consider two parameters generalization of the Fibonacci numbers and Pell numbers, named as the -Fibonacci numbers. We give some new interpretations of these numbers. Moreover using these interpretations we prove some identities for the -Fibonacci numbers
Semidefinite Programming and Ramsey Numbers
No full textFinding exact Ramsey numbers is a problem typically restricted to relatively small graphs. The flag algebra method was developed to find asymptotic results for very large graphs, so it seems that the method is not suitable for finding small Ramsey numbers. But this intuition is wrong, and we will develop a technique to do just that in this paper.
We find new upper bounds for many small graph and hypergraph Ramsey numbers. As a result, we prove the exact values R(K−4, K−4, K−4) = 28, R(K8,C5)=29, R(K9,C6)=41, R(Q3,Q3)=13, R(K3,5,K1,6)=17, R(C3,C5,C5)=17, and R(K−4, K−5; 3) = 12.
We hope that this technique will be adapted to address other questions for smaller graphs with the flag algebra method.This is a preprint made available through arxiv: https://doi.org/10.48550/arXiv.1704.03592
Some new results on k-free numbers
No full textAbstractIn this paper we obtain an improved asymptotic formula on the frequency of k-free numbers with a given difference. We also give a new upper bound of Barban–Davenport–Halberstam type for the k-free numbers in arithmetic progressions
The Generalized k-Fibonacci and k-Lucas Numbers
No full textIn this paper we give the generalization {G(k,n)}(n is an element of N) of k-Fibonacci and k-Lucas numbers. After that, by using this generalization, it has been obtained some new algebraic properties on these numbers
Semidefinite Programming and Ramsey Numbers
No full textFinding exact Ramsey numbers is a problem typically restricted to relatively small graphs. The flag algebra method was developed to find asymptotic results for very large graphs, so it seems that the method is not suitable for finding small Ramsey numbers. But this intuition is wrong, and we will develop a technique to do just that in this paper. We find new upper bounds for many small graph and hypergraph Ramsey numbers. As a result, we prove the exact values R(K−4, K−4, K−4) = 28, R(K8,C5) = 29, R(K9,C6) = 41, R(Q3,Q3) = 13, R(K3,5,K1,6) = 17, R(C3,C5,C5) = 17, and R(K−4, K−5; 3) = 12. We hope that this technique will be adapted to address other questions for smaller graphs with the flag algebra method.This article is published as Lidicky, Bernard, and Florian Pfender. "Semidefinite programming and Ramsey numbers." SIAM Journal on Discrete Mathematics 35, no. 4 (2021): 2328-2344. https://doi.org/10.1137/18M1169473. Posted with permission
On k-balancing numbers
No full textWOS: 000419244400004In this work, we consider some algebraic properties of k-balancing numbers. We deduce some formulas for the greatest common divisor of k-balancing numbers, divisibility properties of k-balancing numbers, sums of k-balancing numbers and simple continued fraction expansion of k-balancing numbers
- …
