An improved upper bound on the error probability (first error event) of time-invariant convolutional codes, and the resulting error exponent, is derived in this paper. The improved error bound depends on both the delay of the code and its width (the number of symbols that enter the delay line in parallel) . Determining the error exponent of time-invariant convolutional codes is an open problem....

The asymptotic performance of a polar code under successive cancellation decoding is determined by the exponent of its polarizing matrix. We first prove that the partial distances of a polarizing matrix constructed from the Kronecker product are simply expressed as a product of those of its component matrices. We then show that the exponent of the polarizing matrix is shown to be a weighted sum...

The Riemann zeta function on the critical line can be computed using a straightforward application of the Riemann-Siegel formula, Schönhage’s method, or Heath-Brown’s method. The complexities of these methods have exponents 1/2, 3/8 (=0.375), and 1/3 respectively. In this paper, three new fast and potentially practical methods to compute zeta are presented. One method is very simple. Its comple...

  Application of Archie equation in carbonate reservoirs is not easy due to high dependence of its parameters on carbonate characteristics. Carbonates are very heterogeneous in nature and hydrocarbon reserve estimation in these reservoirs of mostly oil-wet and intermediate-wet is highly influenced by the input values of saturation exponent. To our knowledge, non representative oils have been us...

The exponent of a word is the ratio of its length over its smallest period. The repetitive threshold r(a) of an a-letter alphabet is the smallest rational number for which there exists an infinite word whose finite factors have exponent at most r(a). This notion was introduced in 1972 by Dejean who gave the exact values of r(a) for every alphabet size a as it has been eventually proved in 2009....

Let p be a prime. A group is called p-closed if it has a normal Sylow p-subgroup and it is called p-exponent closed if the elements of order dividing p form a subgroup. A group is minimal non-p-closed if it is not p-closed but its proper subgroups and homomorphic images are. Similarly, a group is called minimal non-p-exponent closed if it is not p-exponent closed but all its proper subgroups an...

For any fixed power exponent, it is shown that the first digits of powerful integer powers follow a generalized Benford law (GBL) with size-dependent exponent that converges asymptotically to a GBL with the inverse double power exponent. In particular, asymptotically as the power goes to infinity these sequences obey Benford's law. Moreover, the existence of a one-parametric size-dependent expo...

If A is a primitive matrix, then there is a smallest power of A (its fully indecomposable exponent) that is fully indecomposable, and a smallest power of A (its strict fully indecomposable exponent) starting from which all powers are fully indecomposable. We obtain bounds on these two exponents.

In this paper, we investigate a weighted self-propelled particles system, wherein each agent’s direction is determined by its spatial neighbors’ directions with exponential weights concerning the neighbor numbers. In order to describe the fact that some agent with more neighbors might have much larger influence on its neighbors, we introduce a scaling exponent of the neighbor number between 0 a...