English
Related papers

Related papers: A Fibonacci sequence for linear structures with tw…

200 papers

This paper describes a class of sequences that are in many ways similar to Fibonacci sequences: given n, sum the previous two terms and divide them by the largest possible power of n. The behavior of such sequences depends on n. We analyze…

Number Theory · Mathematics 2014-03-20 Brandon Avila , Tanya Khovanova

In this paper, a class of combinatorial identities is proved. A method is used which is based on the following rule: counting elements of a given set in two ways and making equal the obtained results. This rule is known as "counting in two…

Discrete Mathematics · Computer Science 2009-02-09 Krassimir Yankov Iordjev , Dimiter Stoichkov Kovachev

We derive a collection of identities for bivariate Fibonacci and Lucas polynomials using essentially a matrix approach as well as properties of such polynomials when the variables $x$ and $y$ are replaced by polynomials. A wealth of…

Combinatorics · Mathematics 2007-05-23 Mario Catalani

We analyse strategic, complete information, sequential voting with ordinal preferences over the alternatives. We consider several voting mechanisms: plurality voting and approval voting with deterministic or uniform tie-breaking rules. We…

Computer Science and Game Theory · Computer Science 2019-04-19 Oren Dean , Yakov Babichenko , Moshe Tennenholtz

Voting is a commonly applied method for the aggregation of the preferences of multiple agents into a joint decision. If preferences are binary, i.e., "yes" and "no", every voting system can be described by a (monotone) Boolean function…

Computer Science and Game Theory · Computer Science 2016-07-15 Martin Olsen , Sascha Kurz , Xavier Molinero

A "repeat voting" procedure is proposed, whereby voting is carried out in two identical rounds. Every voter can vote in each round, the results of the first round are made public before the second round, and the final result is determined…

Theoretical Economics · Economics 2022-11-30 Sergiu Hart

We look at a family of meta-Fibonacci sequences which arise in studying the number of leaves at the largest level in certain infinite sequences of binary trees, restricted compositions of an integer, and binary compact codes. For this…

Combinatorics · Mathematics 2007-05-23 Brad Jackson , Frank Ruskey

The goal of this paper is twofold. First and foremost, we aim to experimentally and quantitatively show that the choice of a multiwinner voting rule can play a crucial role on the way minorities are represented. We also test the possibility…

Computer Science and Game Theory · Computer Science 2016-04-11 Piotr Faliszewski , Jean-Francois Laslier , Robert Schaefer , Piotr Skowron , Arkadii Slinko , Nimrod Talmon

We speculate on the distribution of primes in exponentially growing, linear recurrence sequences $(u_n)_{n\geq 0}$ in the integers. By tweaking a heuristic which is successfully used to predict the number of prime values of polynomials, we…

Number Theory · Mathematics 2024-09-10 Jon Grantham , Andrew Granville

To make a joint decision, agents (or voters) are often required to provide their preferences as linear orders. To determine a winner, the given linear orders can be aggregated according to a voting protocol. However, in realistic settings,…

Computational Complexity · Computer Science 2010-05-03 Nadja Betzler , Britta Dorn

We derive a general recurrence relation for squares of Fibonacci-like numbers. Various properties are developed, including double binomial summation identites.

General Mathematics · Mathematics 2019-01-09 Kunle Adegoke , Tokunbo Omiyinka

The research aims to construct a new type of matrix called the Fibonacci-Hessenberg-Lorentz matrix by multiplying Fibonacci-Hessenberg matrices with Lorentz matrix multiplication. The study will start by examining the properties of…

General Mathematics · Mathematics 2024-10-31 Ibrahim Gokcan , Ali Hikmet Deger

The goal of confidence-set learning in the binary classification setting is to construct two sets, each with a specific probability guarantee to cover a class. An observation outside the overlap of the two sets is deemed to be from one of…

Machine Learning · Statistics 2018-10-01 Wenbo Wang , Xingye Qiao

We study formulas expressing Fibonacci numbers as sums over compositions using free submonoids of the free monoid of compositions with parts 1 and 2.

Combinatorics · Mathematics 2013-03-20 Ira M. Gessel , Ji Li

We study the bidimensional voter model on a square lattice with numerical simulations. We demonstrate that the evolution takes place in two distinct dynamic regimes; a first approach towards critical site percolation and a further approach…

Statistical Mechanics · Physics 2015-10-14 Alessandro Tartaglia , Leticia F. Cugliandolo , Marco Picco

Scoring protocols are a broad class of voting systems. Each is defined by a vector $(\alpha_1,\alpha_2,...,\alpha_m)$, $\alpha_1 \geq \alpha_2 \geq >... \geq \alpha_m$, of integers such that each voter contributes $\alpha_1$ points to…

Computer Science and Game Theory · Computer Science 2007-05-23 Edith Hemaspaandra , Lane A. Hemaspaandra

We model voting behaviour in the multi-group setting of a two-tier voting system using sequences of de Finetti measures. Our model is defined by using the de Finetti representation of a probability measure (i.e. as a mixture of…

Probability · Mathematics 2026-01-14 Gabor Toth

Consider a non-standard numeration system like the one built over the Fibonacci sequence where nonnegative integers are represented by words over $\{0,1\}$ without two consecutive 1. Given a set $X$ of integers such that the language of…

Formal Languages and Automata Theory · Computer Science 2009-07-06 J. Bell , E. Charlier , A. S. Fraenkel , M. Rigo

In elections, the vote shares or turnout rates show a strong spatial correlation. The logarithmic decay with distance suggests that a 2D noisy diffusive equation describes the system. Based on the study of U.S. presidential elections data,…

Physics and Society · Physics 2019-05-29 Shintaro Mori , Masato Hisakado , Kazuaki Nakayama

The Fibonacci sequence is obtained as weighted sum along the rows in the Pascal triangle by choosing a periodic up-and-down pattern of weights from the set $\{-1,-\frac{1}{2},0, \frac{1}{2}, 1\}$. A graphical illustration of this identity…

History and Overview · Mathematics 2018-11-07 Bernhard Moser