中文
相关论文

相关论文: On a sequence related to the Josephus problem

200 篇论文

This article demonstrates a new kind of programmable logic for the representation of an integer that can be used for the programmable Josephson voltage standard. It can enable the numbers of junctions in most bits to be variable integer…

新兴技术 · 计算机科学 2024-08-15 Wenhui Cao , Erkun Yang , Jinjin Li , Guanhua She , Yuan Zhong , Qing Zhong , Da Xu , Xueshen Wang , Xiaolong Xu , Shijian Wang , Jian Chen

Let $q\in(1,2)$ and $x\in[0,\frac1{q-1}]$. We say that a sequence $(\varepsilon_i)_{i=1}^{\infty}\in\{0,1\}^{\mathbb{N}}$ is an expansion of $x$ in base $q$ (or a $q$-expansion) if \[ x=\sum_{i=1}^{\infty}\varepsilon_iq^{-i}. \] For any…

数论 · 数学 2014-10-27 Simon Baker , Nikita Sidorov

For three natural classes of dynamic decision problems; 1. additively separable problems, 2. discounted problems, and 3. discounted problems for a fixed discount factor; we provide necessary and sufficient conditions for one sequential…

理论经济学 · 经济学 2024-05-24 Mark Whitmeyer , Cole Williams

We study a correspondence between numerical sets and integer partitions that leads to a bijection between simultaneous core partitions and the integer points of a certain polytope. We use this correspondence to prove combinatorial results…

组合数学 · 数学 2022-01-25 Hannah Constantin , Benjamin Houston-Edwards , Nathan Kaplan

Let $G$ be a finite cyclic group. Every sequence $S$ over $G$ can be written in the form $S=(n_1g)\cdot...\cdot(n_lg)$ where $g\in G$ and $n_1,\cdots,n_l\in[1,{\hbox{\rm ord}}(g)]$, and the index $\ind(S)$ of $S$ is defined to be the…

数论 · 数学 2014-01-31 Li-meng Xia

We introduce a bijection between inequivalent minimal factorizations of the n-cycle (1 2 ... n) into a product of smaller cycles of given length, on one side, and trees of a certain structure on the other. We use this bijection to count the…

组合数学 · 数学 2010-12-14 G. Berkolaiko , J. M. Harrison , M. Novaes

We study the complexity of the following cell connection and separation problems in segment arrangements. Given a set of straight-line segments in the plane and two points $a$ and $b$ in different cells of the induced arrangement: (i)…

计算几何 · 计算机科学 2011-06-21 Helmut Alt , Sergio Cabello , Panos Giannopoulos , Christian Knauer

We give several partial positive answers to a question of Juhasz and Szentmiklossy regarding the minimum number of discrete sets required to cover a compact space. We study the relationship between the size of discrete sets, free sequences…

一般拓扑 · 数学 2010-07-02 Santi Spadaro

Twin prime number problem is mainly the structure of the twin prime numbers and whether there are infinitely many prime twins group. In this paper, by constructing a special cluster number set(see formula(2.3)in the paper), proves that the…

综合数学 · 数学 2014-05-14 Zhang Baoshan

This paper deals with fractional differential equations, with dependence on a Caputo fractional derivative of real order. The goal is to show, based on concrete examples and experimental data from several experiments, that fractional…

综合数学 · 数学 2016-11-03 Ricardo Almeida , Nuno R. O. Bastos , M. Teresa T. Monteiro

The Josephus problem is a well--studied elimination problem consisting in determining the position of the survivor after repeated applications of a deterministic rule removing one person at a time from a given group. A natural probabilistic…

For Lebesgue generic $(x_1,x_2)\in \mathbb{R}^2$, we investigate the distribution of small values of products $q\cdot \|qx_1\| \cdot \|qx_2\|$ with $q\in\mathbb{N}$, where $\|\cdot \|$ denotes the distance to the closest integer. The main…

数论 · 数学 2023-11-22 Michael Björklund , Reynold Fregoli , Alexander Gorodnik

This paper addresses the problem of sequential submodular maximization: selecting and ranking items in a sequence to optimize some composite submodular function. In contrast to most of the previous works, which assume access to the utility…

机器学习 · 计算机科学 2024-09-10 Jing Yuan , Shaojie Tang

We look at extensions of formulas given by Jovovic and recently proved by Dhar on integer partitions where the smallest part occurs at least $m$ times and on integer partitions with fixed differences between the largest and smallest parts…

组合数学 · 数学 2024-01-08 Pankaj Jyoti Mahanta , Manjil P. Saikia

In this short note we present a class of conjectures on partitions of integers as summations of primes, which are extensions of Goldbach conjecture.

综合数学 · 数学 2007-07-17 Florentin Smarandache

Having in mind applications to particle physics we develop the differential calculus over Jordan algebras and the theory of connections on Jordan modules. In particular we focus on differential calculus over the exceptional Jordan algebra…

量子代数 · 数学 2018-07-04 Alessandro Carotenuto , Ludwik Dabrowski , Michel Dubois-Violette

In this paper the fractional-order Mandelbrot and Julia sets in the sense of $q$-th Caputo-like discrete fractional differences, for $q\in(0,1)$, are introduced and several properties are analytically and numerically studied. Some…

混沌动力学 · 物理学 2022-10-06 Marius-F. Danca , Michal Feckan

In this paper, we study uniqueness problems for an entire function that shares small functions of finite order with their difference operators. In particular, we give a generalization of results in [2,3,13].

We establish the existence and symmetry of all minimizers of a constrained variational problem involving the fractional gradient. This problem is closely connected to some fractional kinetic equations.

偏微分方程分析 · 数学 2012-05-08 H. Hajaiej

The Dirichlet divisor problem is used as a model to give a conjecture concerning the conditional convergence of the Dirichlet series of an L-function.

数论 · 数学 2009-03-05 Michael O. Rubinstein