標(biāo)題: Titlebook: Combinatorial and Additive Number Theory II; CANT, New York, NY, Melvyn B. Nathanson Conference proceedings 2017 Springer International Pu [打印本頁] 作者: Concave 時間: 2025-3-21 20:07
書目名稱Combinatorial and Additive Number Theory II影響因子(影響力)
書目名稱Combinatorial and Additive Number Theory II影響因子(影響力)學(xué)科排名
書目名稱Combinatorial and Additive Number Theory II網(wǎng)絡(luò)公開度
書目名稱Combinatorial and Additive Number Theory II網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Combinatorial and Additive Number Theory II被引頻次
書目名稱Combinatorial and Additive Number Theory II被引頻次學(xué)科排名
書目名稱Combinatorial and Additive Number Theory II年度引用
書目名稱Combinatorial and Additive Number Theory II年度引用學(xué)科排名
書目名稱Combinatorial and Additive Number Theory II讀者反饋
書目名稱Combinatorial and Additive Number Theory II讀者反饋學(xué)科排名
作者: conference 時間: 2025-3-21 20:29 作者: 陶器 時間: 2025-3-22 04:07 作者: 沉思的魚 時間: 2025-3-22 04:53 作者: HERE 時間: 2025-3-22 09:01
,A Misère-Play ,-Operator,eory 1:443–458, 1965). Here, we extend the operator to the misère-play convention and prove convergence and other properties; notably, more structure is obtained under misère-play as compared with the normal-play convention (Larsson in Theoret. Comput. Sci. 422:52–58, 2012).作者: AER 時間: 2025-3-22 16:35
,Extending Babbage’s (Non-)Primality Tests,factor test. We also prove a partial converse of his non-primality test, based on a single congruence. Along the way we encounter Bachet, Bernoulli, Bézout, Euler, Fermat, Kummer, Lagrange, Lucas, Vandermonde, Waring, Wilson, Wolstenholme, and several contemporary mathematicians.作者: AER 時間: 2025-3-22 18:29
C. L. Moreira,J. A. Pe?as Lopesmset of ., respectively. Here we review some of what is known and not yet known about the minimum sizes of these three types of sumsets, as well as their corresponding critical numbers. In particular, we discuss several new open direct and inverse problems.作者: Bereavement 時間: 2025-3-22 22:22 作者: Albumin 時間: 2025-3-23 03:36 作者: superfluous 時間: 2025-3-23 07:01 作者: 敬禮 時間: 2025-3-23 12:08 作者: attenuate 時間: 2025-3-23 15:31 作者: Mets552 時間: 2025-3-23 20:07 作者: 積習(xí)難改 時間: 2025-3-23 22:53 作者: Predigest 時間: 2025-3-24 03:20 作者: 羅盤 時間: 2025-3-24 07:09
Elias G. Carayannis,David F. J. Campbellry argument then uses this to prove an inequality for an initial sum of the Legendre symbol . for any odd prime ., namely ., with strict inequality if and only if .. From computations with the first 25000 primes, Sondow conjectured that .also with strict inequality if and only if .. In this note, we作者: grovel 時間: 2025-3-24 10:59 作者: carotid-bruit 時間: 2025-3-24 18:41 作者: 鋼盔 時間: 2025-3-24 19:39
Meriem Tazir,Markus G?ttemann,Ksenia Grubetsiquely in the form . with . for all . and . for only finitely many .. In 1956, de Bruijn proved that every additive system is constructed from an infinite sequence . of integers with . for all . or is a contraction of such a system. This paper discusses limits and the stability of additive systems a作者: implore 時間: 2025-3-25 01:33 作者: 使顯得不重要 時間: 2025-3-25 06:13
Melvyn B. NathansonCollates recent advances in combinatorial and additive number theory from distinguished mathematicians in the field.Points to future areas of research.All papers feature original, peer-reviewed conten作者: Redundant 時間: 2025-3-25 09:06
Springer Proceedings in Mathematics & Statisticshttp://image.papertrans.cn/c/image/230027.jpg作者: LUT 時間: 2025-3-25 15:31
Combinatorial and Additive Number Theory II978-3-319-68032-3Series ISSN 2194-1009 Series E-ISSN 2194-1017 作者: badinage 時間: 2025-3-25 18:14 作者: jovial 時間: 2025-3-25 23:02 作者: Type-1-Diabetes 時間: 2025-3-26 04:06
Evaluation Indicators for Smart Prison points of a certain polytope. We use this correspondence to prove combinatorial results about core partitions. For small values of ., we give formulas for the number of (.,?.)-core partitions corresponding to numerical semigroups. We also study the number of partitions with a given hook set.作者: 詼諧 時間: 2025-3-26 04:39
Juan Manuel Jauregui Becker,Wessel W. Wits . times, or differing by less than .. We find results on their behavior and generating functions: more results for those simultaneously regular and distinct, fewest for those distinct and flat. We offer some conjectures in the area.作者: Spongy-Bone 時間: 2025-3-26 11:28 作者: Addictive 時間: 2025-3-26 12:56
https://doi.org/10.1007/978-3-658-38236-0factor test. We also prove a partial converse of his non-primality test, based on a single congruence. Along the way we encounter Bachet, Bernoulli, Bézout, Euler, Fermat, Kummer, Lagrange, Lucas, Vandermonde, Waring, Wilson, Wolstenholme, and several contemporary mathematicians.作者: Ischemic-Stroke 時間: 2025-3-26 19:12
https://doi.org/10.1007/978-3-319-68032-3Additive number theory; Combinatorial number theory; Goldbach conjecture; Mathematics and computer scie作者: 輕彈 時間: 2025-3-26 23:37 作者: 羅盤 時間: 2025-3-27 03:47 作者: PRE 時間: 2025-3-27 09:07
https://doi.org/10.1007/978-981-16-9657-2We obtain bounds on the number of triples that determine a given pair of dot products arising in a vector space over a finite field or a module over the set of integers modulo a power of a prime. More precisely, given . or ., we provide bounds on the size of the set .for units . and ..作者: STELL 時間: 2025-3-27 11:20 作者: ZEST 時間: 2025-3-27 14:33 作者: 矛盾心理 時間: 2025-3-27 19:24 作者: 聲音刺耳 時間: 2025-3-28 00:12 作者: 愛哭 時間: 2025-3-28 02:10
Pairs of Dot Products in Finite Fields and Rings,We obtain bounds on the number of triples that determine a given pair of dot products arising in a vector space over a finite field or a module over the set of integers modulo a power of a prime. More precisely, given . or ., we provide bounds on the size of the set .for units . and ..作者: Blood-Clot 時間: 2025-3-28 06:25 作者: Organization 時間: 2025-3-28 12:06
,A New Proof of Khovanski?’s Theorem on the Geometry of Sumsets,Khovanski? studied how iterated sumsets grow geometrically, and provided the growth polynomial for sumsets as well as an approximation to lattice points inside polytopes. In this paper, we present a new proof of the theorem about geometric growth of sumsets.作者: perjury 時間: 2025-3-28 16:25 作者: slow-wave-sleep 時間: 2025-3-28 20:29
Andreas Braun,Bj?rn Ebel,Albert Alberssuch that .. We establish direct relations between these three functions. In particular, we express each one of them in terms of each other one. We also characterize the representation functions by an intrinsic recursive relation which is a necessary and sufficient condition.作者: Omnipotent 時間: 2025-3-29 01:41
Characteristic, Counting, and Representation Functions Characterized,such that .. We establish direct relations between these three functions. In particular, we express each one of them in terms of each other one. We also characterize the representation functions by an intrinsic recursive relation which is a necessary and sufficient condition.作者: wangle 時間: 2025-3-29 03:54 作者: Daily-Value 時間: 2025-3-29 10:20
https://doi.org/10.1007/978-981-16-9657-2ities can then be used to calculate . for large values of .. Further, these identities correspond to generating function identities involving a sequence of polynomials which have suggestive connections to Eulerian polynomials.作者: 名詞 時間: 2025-3-29 14:55
Elias G. Carayannis,David F. J. Campbell and only if .. From computations with the first 25000 primes, Sondow conjectured that .also with strict inequality if and only if .. In this note, we prove that equality holds when ., and that if . then . . exceeds the class number .. We also give extensions to the Jacobi and Kronecker symbols ..作者: Hot-Flash 時間: 2025-3-29 17:48
Meriem Tazir,Markus G?ttemann,Ksenia Grubetsnite sequence . of integers with . for all . or is a contraction of such a system. This paper discusses limits and the stability of additive systems and also describes the “uncontractable” or “indecomposable” additive systems.作者: Morsel 時間: 2025-3-29 20:31 作者: 嚴(yán)厲譴責(zé) 時間: 2025-3-30 03:12
Initial Sums of the Legendre Symbol: Is , ?, and only if .. From computations with the first 25000 primes, Sondow conjectured that .also with strict inequality if and only if .. In this note, we prove that equality holds when ., and that if . then . . exceeds the class number .. We also give extensions to the Jacobi and Kronecker symbols ..作者: AVERT 時間: 2025-3-30 05:56 作者: 不適 時間: 2025-3-30 10:01 作者: Range-Of-Motion 時間: 2025-3-30 12:23
Conference proceedings 2017c that reflects the latest results by experts in the field. Researchers and graduate students interested in the current progress in number theory will find this selection of articles relevant and compelling.?.作者: 過分自信 時間: 2025-3-30 19:31 作者: gusher 時間: 2025-3-30 21:50
Der Betriebsrat und die Gewerkschaftd proofs wherever possible and hope that this survey may serve as a compact guide to recent advances in arithmetic combinatorics over finite fields. We do not claim originality for any of the results.作者: Inflated 時間: 2025-3-31 04:36
Liselotte Schebek,Hans-Joachim Linkemeeting on Friday morning, one of the Polish mathematicians called the hotel. He did not get through, and no one tried to telephone the hotel again for several hours. By the time it was learned that Paul was in the hospital, he was dead.作者: 行乞 時間: 2025-3-31 08:04
Benford Behavior of Generalized Zeckendorf Decompositions,kendorf decomposition converges to Benford’s law almost surely. Our results hold more generally: One obtains similar theorems to those regarding the distribution of leading digits when considering how often values in sets with density are attained in the summands in the decompositions.作者: 衰弱的心 時間: 2025-3-31 11:24
A Second Wave of Expanders in Finite Fields,d proofs wherever possible and hope that this survey may serve as a compact guide to recent advances in arithmetic combinatorics over finite fields. We do not claim originality for any of the results.作者: 最初 時間: 2025-3-31 15:46
,The Erd?s Paradox,meeting on Friday morning, one of the Polish mathematicians called the hotel. He did not get through, and no one tried to telephone the hotel again for several hours. By the time it was learned that Paul was in the hospital, he was dead.作者: 前奏曲 時間: 2025-3-31 17:31 作者: ANNUL 時間: 2025-3-31 22:17 作者: Indent 時間: 2025-4-1 04:30
https://doi.org/10.1007/978-981-16-9657-2 in progression with any of the previous elements. Rankin characterized the greedy geometric-progression-free set in terms of the greedy arithmetic set. We characterize the greedy exponential set and prove that it has asymptotic density 1 and then discuss how the optimality of the greedy set depends作者: Spinal-Tap 時間: 2025-4-1 09:29
Open Problems About Sumsets in Finite Abelian Groups: Minimum Sizes and Critical Numbers,mset of ., respectively. Here we review some of what is known and not yet known about the minimum sizes of these three types of sumsets, as well as their corresponding critical numbers. In particular, we discuss several new open direct and inverse problems.作者: aerobic 時間: 2025-4-1 13:31 作者: 和藹 時間: 2025-4-1 17:16 作者: 積極詞匯 時間: 2025-4-1 20:00
