Results 11 to 20 of about 6,585 (262)
The complexity of divisibility [PDF]
Linear Algebra and its Applications, 2016 We address two sets of long-standing open questions in probability theory, from a computational complexity perspective: divisibility of stochastic maps, and divisibility and decomposability of probability distributions. We prove that finite divisibility of stochastic maps is an NP-complete problem, and extend this result to nonnegative matrices, and ...
Bausch, Johannes, Cubitt, Toby
core +8 more sources
On a divisibility problem [PDF]
Mathematica Bohemica, 2019 Let $p_1, p_2, \cdots$ be the sequence of all primes in ascending order. Using explicit estimates from the prime number theory, we show that if $ k \geq5 $, then (p_{k+1}-1)! \mid(\tfrac12 (p_{k +1} - 1))! p_ k!, which improves a previous result of
Shichun Yang, Florian Luca, Alain Togbé
doaj +3 more sources
Primes in divisibility sequences [PDF]
, 2001 We give an overview of two important families of divisibility sequences: the Lehmer--Pierce family (which generalise the Mersenne sequence) and the elliptic divisibility sequences.
Ward, Thomas, Everest, Graham
core +12 more sources
On Exact Division and Divisibility Testing for Sparse Polynomials [PDF]
Proceedings of the 2021 International Symposium on Symbolic and Algebraic Computation, 2021 No polynomial-time algorithm is known to test whether a sparse polynomial G divides another sparse polynomial $F$. While computing the quotient Q=F quo G can be done in polynomial time with respect to the sparsities of F, G and Q, this is not yet sufficient to get a polynomial-time divisibility test in general.
Pascal Giorgi +2 more
openaire +4 more sources
, 2015 In this paper, we address an infamous argument against divisibility that dates back to Zeno. There has been an incredible amount of discussion on how to understand the critical notions of divisibility, extension, and infinite divisibility that are crucial for the very formulation of the argument. The paper provides new and rigorous definitions of those
Vincenzo Fano, Claudio Calosi
openaire +3 more sources
Fair Division of Mixed Divisible and Indivisible Goods [PDF]
Proceedings of the AAAI Conference on Artificial Intelligence, 2020 We study the problem of fair division when the resources contain both divisible and indivisible goods. Classic fairness notions such as envy-freeness (EF) and envy-freeness up to one good (EF1) cannot be directly applied to the mixed goods setting. In this work, we propose a new fairness notion envy-freeness for mixed goods (EFM), which is a direct ...
Xiaohui Bei +4 more
openaire +5 more sources
Mathematics in Computer Science, 2018 To appear in Mathematics in Computer ...
Nello Blaser, Morten Brun
openaire +3 more sources
Arithmetics II – Divisibility. The Fibonacci sequence
, 2021 summary:Autoři článku se zabývají otázkou, jak přispět k rozvoji aritmetických dovedností žáků. V článku jsou představeny některé méně známe vlastnosti Fibonacciho posloupnosti.
Jančařík, Antonín +2 more
core +2 more sources
Congruencies and divisibility criteria [PDF]
, 2022 The theme of this scientific work is "Congruencies" and its delimitation is "Congruencies and the criteria of divisibility", considering the following problem: when a whole number is divisible by 2 to 11, supported by the properties of Congruencies ...
Firmino, Rebeca Menezes
core +1 more source
Algebraic divisibility sequences over function fields [PDF]
, 2011 In this note we study the existence of primes and of primitive divisors in function field analogues of classical divisibility sequences. Under various hypotheses, we prove that Lucas sequences and elliptic divisibility sequences over function fields ...
Mahe, Valery +14 more
core +2 more sources