Related papers: On a sequence related to the Josephus problem

This paper studies the problem of, given the structure of a linear-time invariant system and a set of possible inputs, finding the smallest subset of input vectors that ensures system's structural controllability. We refer to this problem…

An approximate divisor order is a partial order on the positive integers $\mathbb{N}^+$ that refines the divisor order and is refined by the additive total order. A previous paper studied such a partial order on $\mathbb{N}^+$, produced…

Divisors whose Jacobian ideal is of linear type have received a lot of attention recently because of its connections with the theory of D-modules. In this work we are interested on divisors of expected Jacobian type, that is, divisors whose…

In the paper, the authors present several new relations and applications for the combinatorial sequence that counts the possible partitions of a finite set with the restriction that the size of each block is contained in a given set. One of…

In this paper we study existence, regularity, and approximation of solution to a fractional semilinear elliptic equation of order $s \in (0,1)$. We identify minimal conditions on the nonlinear term and the source which leads to existence of…

Given a subset $W$ of an abelian group $G$, a subset $C$ is called an additive complement for $W$ if $W+C=G$; if, moreover, no proper subset of $C$ has this property, then we say that $C$ is a minimal complement for $W$. It is natural to…

In this article, a relation between a gap $d_{k}$ and divisors of composite numbers between $p_{k}$ and $p_{k+1}$ is established.

This work lies across three areas (in the title) of investigation that are by themselves of independent interest. A problem that arose in quantum computing led us to a link that tied these areas together. This link consists of a single…

Given a set of integers W, the Partition problem determines whether W can be divided into two disjoint subsets with equal sums. We model the Partition problem as a system of polynomial equations, and then investigate the complexity of a…

The Sequential Multiple Knapsack Problem is a special case of Multiple knapsack problem in which the items sizes are divisible. A characterization of the optimal solutions of the problem and a description of the convex hull of all the…

It is well-known that a nilpotent n by n matrix B is determined up to conjugacy by a partition of n formed by the sizes of the Jordan blocks of B. We call this partition the Jordan type of B. We obtain partial results on the following…

For a set of positive integers $D$, a $k$-term $D$-diffsequence is a sequence of positive integers $a_1<a_2<\cdots<a_k$ such that $a_i-a_{i-1}\in D$ for $i=2,3,\cdots,k$. For $k\in\mathbb{Z}^+$ and $D\subset \mathbb{Z}^+$, we define…

We solve the satisfiability problem for a three-sorted fragment of set theory (denoted $3LQST_0^R$), which admits a restricted form of quantification over individual and set variables and the finite enumeration operator $\{\text{-},…

We study a problem of Douglass and Ono concerning the smallest integer $n$ such that the partition function $p(n)$ begins with a specified string of digits $f$ in base $b$. By employing an elementary discrepancy framework, we establish new…

We introduce several new constructions of finite posets with the number of linear extensions given by generalized continued fractions. We apply our results to the problem of the minimum number of elements needed for a poset with a given…

Every conditionally convergent series of real numbers has a divergent subseries. How many subsets of the natural numbers are needed so that every conditionally convergent series diverges on the subseries corresponding to one of these sets?…

We study short intervals which contain an ``almost square'', an integer $n$ that can be factored as $n = ab$ with $a$, $b$ close to $\sqrt{n}$. This is related to the problem on distribution of $n^2 \alpha \pmod 1$ and the problem on gaps…

We consider the variational inequality problem over the intersection of fixed point sets of firmly nonexpansive operators. In order to solve the problem, we present an algorithm and subsequently show the strong convergence of the generated…

We show that the proportion of polynomials of degree $n$ over the finite field with $q$ elements, which have a divisor of every degree below $n$, is given by $c_q n^{-1} + O(n^{-2})$. More generally, we give an asymptotic formula for the…

We present a simple, natural #P-complete problem. Let G be a directed graph, and let k be a positive integer. We define q(G;k) as follows. At each vertex v, we place a k-dimensional complex vector x_v. We take the product, over all edges…