中文
相关论文

相关论文: The Binary Mole

200 篇论文

New results are reported from an ongoing international research effort to accurately determine the Avogadro constant by counting the atoms in an isotopically enriched silicon crystal. The surfaces of two 28Si-enriched spheres were…

Hasanalizade [1] studied Deaconescu's conjecture for positive composite integer $n$. A positive composite integer $n\geq4$ is said to be a Deaconescu number if $S_2(n)\mid \phi(n)-1$. In this paper, we improve Hasanalizade's result by…

综合数学 · 数学 2025-07-08 Sagar Mandal

We present results of Monte Carlo simulation aiming at the estimate of the frequency of semi-detached Algol-type binaries among the stars observed as single ones. When account is made for various detection biases (mostly due to inclination…

太阳与恒星天体物理 · 物理学 2017-01-04 O. Yu. Malkov , D. A. Kovaleva , L. R. Yungelson , E. A. Avvakumova , D. A. Chulkov , O. B. Dluzhnevskaya , A. Yu Kniazev

Observations of the Kuiper Belt indicate that a larger than expected percentage of KBO's (approximately 8 out of 500) are in binary pairs. The formation and survival of such objects presents a conundrum [1]. Two competing theories have been…

空间物理 · 物理学 2007-05-23 R. C. Nazzario , T. W. Hyde

Let $n$ be a positive integer. For any integer $a$, we say that $a$ is idempotent modulo $n$ if $a^2\equiv a\pmod n$. The $n$-modular Erd\H{o}s-Burgess constant is the smallest positive integer $\ell$ such that any $\ell$ integers contain…

组合数学 · 数学 2018-07-20 Jun Hao , Haoli Wang , Lizhen Zhang

The blazar OJ287 is the most promising (and the only) case for an extragalactic binary black hole system inspiralling under the action of gravitational radiation reaction. At present, though it is not possible to directly observe the binary…

高能天体物理现象 · 物理学 2012-08-23 M. J. Valtonen , A. Gopakumar , S. Mikkola , K. Wiik , H. J. Lehto

A binary shuffle square is a binary word of even length that can be partitioned into two disjoint, identical subwords. Huang, Nam, Thaper, and the first author conjectured that as $n\rightarrow \infty$, asymptotically half of all binary…

组合数学 · 数学 2025-12-16 Xiaoyu He , Logan Post

The binary sum-of-digits function $s$ counts the number of ones in the binary expansion of a nonnegative integer. For any nonnegative integer $t$, T.~W.~Cusick defined the asymptotic density $c_t$ of integers $n\geq 0$ such that…

数论 · 数学 2022-05-02 Lukas Spiegelhofer , Michael Wallner

Any associative bilinear multiplication on the set of n-by-n matrices over some field of characteristic not two, that makes the same vectors orthogonal and has the same trace as ordinary matrix multiplication, must be ordinary matrix…

环与代数 · 数学 2023-04-21 Chris Heunen , Dominic Horsman

The problem is related to all-or-nothing transforms (AONT) suggested by Rivest as a preprocessing for encrypting data with a block cipher. Since then there have been various applications of AONTs in cryptography and security. D'Arco,…

信息论 · 计算机科学 2016-01-12 Yiwei Zhang , Tao Zhang , Xin Wang , Gennian Ge

It is known that for an arbitrary positive integer \(n\) the sequence \(S(x^n)=(1^n, 2^n, \ldots)\) is complete, meaning that every sufficiently large integer is a sum of distinct \(n\)th powers of positive integers. We prove that every…

数论 · 数学 2017-07-11 Doyon Kim

It is conjectured that every integer N>454 is the sum of seven nonnegative cubes. We prove the conjecture when N is a multiple of 4.

数论 · 数学 2009-03-27 Kent D. Boklan , Noam D. Elkies

We present a construction of 1-perfect binary codes, which gives a new lower bound on the number of such codes. We conjecture that this lower bound is asymptotically tight.

组合数学 · 数学 2009-09-25 Denis Krotov , Sergey Avgustinovich

We investigate binary voting systems with two types of voters and a hierarchy among the members in each type, so that members in one class have more influence or importance than members in the other class. The purpose of this paper is to…

组合数学 · 数学 2009-07-23 Josep Freixas , Xavier Molinero , Salvador Roura

Multiplication is one of the most fundamental computational problems, yet its true complexity remains elusive. The best known upper bound, by F\"{u}rer, shows that two $n$-bit numbers can be multiplied via a boolean circuit of size $O(n \lg…

数据结构与算法 · 计算机科学 2019-03-01 Peyman Afshani , Casper Benjamin Freksen , Lior Kamma , Kasper Green Larsen

In the attempt to shed new light on the lambda Boo phenomenon we analyzed the astrometric, photometric and spectroscopic characteristics of stars out of a list of recently selected lambda Boo candidates. We show that the class is still…

天体物理学 · 物理学 2007-05-23 Rosanna Faraggiana , Piercarlo Bonifacio

The sequence A000975 in OEIS can be defined by $A_1=1$, $A_{n+1}=2A_n$ if $n$ is odd, and $A_{n+1}=2A_n+1$ if $n$ is even. This sequence satisfies other recurrence relations, admits some closed formulas, and is known to enumerate several…

组合数学 · 数学 2017-10-17 Jia Huang , Madison Mickey , Jianbai Xu

We generalize the definition of spoof perfect numbers to multiperfect numbers and study their characteristics. As a result, we find several new odd spoof multiperfect numbers, akin to Descartes' number. An example is $8999757$, which would…

数论 · 数学 2025-02-25 László Tóth

Many problems in contemporary astrophysics---from understanding the formation of black holes to untangling the chemical evolution of galaxies---rely on knowledge about binary stars. This, in turn, depends on discovery and characterization…

Enumerative invariants in Algebraic Geometry 'count' $\tau$-(semi)stable objects $E$ with fixed topological invariants $[E]=a$ in some geometric problem, using a virtual class $[{\cal M}_a^{\rm ss}(\tau)]_{\rm virt}$ in homology, for the…

代数几何 · 数学 2021-11-09 Dominic Joyce