On Sequences Not Containing a Large Sum-Free Subsequence

Proceedings of the American Mathematical Society - United States
doi 10.2307/2039106
Full Text
Abstract

Available in full text

Date
Authors
Publisher

JSTOR

Related search

Inductive Methods and Zero-Sum Free Sequences

Integers
2009English

A Comprehensive Comparison of Metaheuristics for the Repetition-Free Longest Common Subsequence Problem

Journal of Heuristics
ControlInformation SystemsManagement ScienceComputer NetworksCommunicationsOptimizationOperations ResearchArtificial IntelligenceSoftware
2017English

On the Three Questions of Bertram on Locally Maximal Sum-Free Sets

Quaestiones Mathematicae
Mathematics
2019English

The Summatory Function of the Sum-Of-Digits Function on Polynomial Sequences

Acta Arithmetica
Number TheoryAlgebra
2002English

Viscosity Sum Rules at Large Scattering Lengths

Physical Review A
2012English

On a Cyclic Sum

Proceedings of the Glasgow Mathematical Association
1963English

Construct, Merge, Solve and Adapt: Application to the Repetition-Free Longest Common Subsequence Problem

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2016English

A Note on the Strong Law of Large Numbers for Associated Sequences

International Journal of Mathematics and Mathematical Sciences
Mathematics
2005English

Distribution of Special Sequences Modulo a Large Prime

International Journal of Mathematics and Mathematical Sciences
Mathematics
2003English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy