中文
相关论文

相关论文: On arithmetic index in the generalized Thue-Morse …

200 篇论文

Let $A \cong k\langle X \rangle / I$ be an associative algebra. A finite word over alphabet $X$ is $I${\it-reducible} if its image in $A$ is a $k$-linear combination of length-lexicographically lesser words. An {\it obstruction} in a…

环与代数 · 数学 2022-06-16 A. J. Kanel-Belov , I. A. Melnikov , I. V. Mitrofanov

For integer $n\geqslant 1$ and real $u$, let $\Delta(n,u):=|\{d:d\mid n,\,{\rm e}^u<d\leqslant {\rm e}^{u+1}\}|$. The Erd\H{o}s--Hooley Delta-function is then defined by $\Delta(n):=\max_{u\in{\mathbb R}}\Delta(n,u).$ We improve the current…

数论 · 数学 2022-10-26 Régis de la Bretèche , Gérald Tenenbaum

An integer $n$ is said to be \textit{arithmetic} if the arithmetic mean of its divisors is an integer. In this paper, using properties of the factorization of values of cyclotomic polynomials, we characterize arithmetic numbers. As an…

数论 · 数学 2012-06-11 Antonio M. Oller-Marcén

The best deterministic unconditionally proven integer factorization algorithms have exponential running time complexities of O(N^(1/4)) arithmetic operations, and conditional on the Riemann hypothesis, there is a deterministic algorithm of…

数论 · 数学 2007-07-31 N. A. Carella

Let $(u_n)_{n\ge 0}$ denote the Thue-Morse sequence with values $\pm 1$. The Woods-Robbins identity below and several of its generalisations are well-known in the literature…

数论 · 数学 2018-05-17 Samin Riasat

We identify pairs of positive integers $(t, d)$ with the property that the integer sequence with general term $\lfloor{n^t/d\rfloor}$ contains at most finitely many primes.

数论 · 数学 2025-01-10 Dan Ismailescu , Yunkyu James Lee

Let $A$ be an $a$-letter alphabet. We consider fractional powers of $A$-strings: if $x$ is a $n$-letter string, $x^r$ is a prefix of $xxxx...$ having length $nr$. Let $l$ be a positive integer. Ilie, Ochem and Shallit defined $R(a,l)$ as…

组合数学 · 数学 2010-12-02 Andrey Rumyantsev

A notable feature of the TTE approach to computability is the representation of the argument values and the corresponding function values by means of infinitistic names. Two ways to eliminate the using of such names in certain cases are…

计算机科学中的逻辑 · 计算机科学 2015-07-01 Dimiter Skordev

For a normal measurable operator $a$ affiliated with a von Neumann factor $\mathcal{M}$ we show: If $\mathcal{M}$ is infinite, then there is $\lambda_0\in \mathbb{C}$ so that for $\varepsilon>0$ there are…

算子代数 · 数学 2023-04-24 Alexei Ber , Matthijs Borst , Fedor Sukochev

Let $p$ be a prime number and $\xi$ an irrational $p$-adic number. Its multiplicative irrationality exponent ${{\mu^{\times}}} (\xi)$ is the supremum of the real numbers ${{\mu^{\times}}}$ for which the inequality $$ |b \xi - a|_{p} \leq |…

数论 · 数学 2021-10-06 Yann Bugeaud

Do\v{s}li\'{c} et al. defined the Mostar index of a graph $G$ as $Mo(G)=\sum\limits_{uv\in E(G)}|n_G(u,v)-n_G(v,u)|$, where, for an edge $uv$ of $G$, the term $n_G(u,v)$ denotes the number of vertices of $G$ that have a smaller distance in…

组合数学 · 数学 2023-06-16 Michael A. Henning , Johannes Pardey , Dieter Rautenbach , Florian Werner

Taking the product of (2n+1)/(2n+2) raised to the power +1 or -1 according to the n-th term of the Thue-Morse sequence gives rise to an infinite product P while replacing (2n+1)/(2n+2) with (2n)/(2n+1) yields an infinite product Q, where P…

数论 · 数学 2014-07-01 Jean-Paul Allouche

A {\it star-factor} of a graph $G$ is a spanning subgraph of $G$ such that each component of which is a star. An {\it edge-weighting} of $G$ is a function $w: E(G)\longrightarrow \mathbb{N}^+$, where $\mathbb{N}^+$ is the set of positive…

组合数学 · 数学 2007-07-03 Yunjian Wu , Qinglin Yu

In large-data applications, it is desirable to design algorithms with a high degree of parallelization. In the context of submodular optimization, adaptive complexity has become a widely-used measure of an algorithm's "sequentiality".…

数据结构与算法 · 计算机科学 2020-04-22 Wenzheng Li , Paul Liu , Jan Vondrak

The assumption of real-number arithmetic, which is at the basis of conventional geometric algorithms, has been seriously challenged in recent years, since digital computers do not exhibit such capability. A geometric predicate usually…

计算几何 · 计算机科学 2007-05-23 Olivier Devillers , Franco P. Preparata

A new integer deterministic factorization algorithm, rated at arithmetic operations to $O(N^{1/6+\varepsilon})$ arithmetic operations, is presented in this note. Equivalently, given the least $(\log N)/6$ bits of a factor of the balanced…

数据结构与算法 · 计算机科学 2022-04-25 N. A. Carella

The same-order type $\tau_e(G)$ of a finite group $G$ is a set formed of the sizes of the equivalence classes containing the same order elements of $G$. In this paper, we study an arithmetical property of this set. More exactly, we outline…

群论 · 数学 2020-12-22 Mihai-Silviu Lazorec , Marius Tarnauceanu

The Thue-Morse set is the set of those nonnegative integers whose binary expansions have an even number of $1$. We obtain an exact formula for the state complexity of the multiplication by a constant of the Thue-Morse set $\mathcal{T}$ with…

形式语言与自动机理论 · 计算机科学 2019-03-15 Émilie Charlier , Célia Cisternino , Adeline Massuir

In this paper, we study $k$-term arithmetic progressions $N, N+d, ..., N+(k-1)d$ of powerful numbers. Under the $abc$-conjecture, we obtain $d \gg_\epsilon N^{1/2 - \epsilon}$. On the other hand, there exist infinitely many $3$-term…

数论 · 数学 2022-10-04 Tsz Ho Chan

A closed word (a.k.a. periodic-like word or complete first return) is a word whose longest border does not have internal occurrences, or, equivalently, whose longest repeated prefix is not right special. We investigate the structure of…

形式语言与自动机理论 · 计算机科学 2014-12-02 Golnaz Badkobeh , Gabriele Fici , Zsuzsanna Lipták