Related papers: Decomposition of Beatty and Complementary Sequence…
Given a finite abelian group $G$, consider the complete graph on the set of all elements of $G$. Find a Hamiltonian cycle in this graph and for each pair of consecutive vertices along the cycle compute their sum. What are the smallest and…
A method is developed for calculating effective sums of divergent series. This approach is a variant of the self-similar approximation theory. The novelty here is in using an algebraic transformation with a power providing the maximal…
Binomial coefficients have been used for centuries in a variety of fields and have accumulated numerous definitions. In this paper, we introduce a new way of defining binomial coefficients as repeated sums of ones. A multitude of binomial…
A new distance function dist(A,B) for fuzzy sets A and B is introduced. It is based on the descriptive complexity, i.e., the number of bits (on average) that are needed to describe an element in the symmetric difference of the two sets. The…
Let A, B, C, D be given finite sets of pairs of n-by-n complex matrices. We describe an algorithm to determine, with finitely many computations, whether there is a single unitary matrix U such that each pair of matrices in A is unitarily…
We present a parallel version of the cut-pursuit algorithm for minimizing functionals involving the graph total variation. We show that the decomposition of the iterate into constant connected components, which is at the center of this…
We derive B\'ezout identities for the minimal polynomials of a finite sequence and use them to prove a theorem of Wang and Massey on binary sequences with a perfect linear complexity profile. We give a new proof of Rueppel's conjecture and…
A superposition of a matrix ensemble refers to the ensemble constructed from two independent copies of the original, while a decimation refers to the formation of a new ensemble by observing only every second eigenvalue. In the cases of the…
Many quantities of interest in communications, signal processing, artificial intelligence, and other areas can be expressed as the partition sum of some factor graph. Although the exact calculation of the partition sum is in many cases…
We analyze a mixed quantum-classical algorithm recently derived from the exact factorization equations [Min, Agostini, Gross, PRL {\bf 115}, 073001 (2015)] to show the role of the different terms in the algorithm in bringing about…
We establish monotone bijections between the Farey sequences of order m and the halfsequences of Farey subsequences associated with the rank m elements of the Boolean lattice of subsets of a 2m-set. We also present a few related…
This study involves definitions for multiple-counting regular and summation sequences of rho. My paper introduces and proves recurrent relationships for multiple-counting sequences and shows their association with Fermat's little theorem. I…
In this paper we give an overview of recent results on (upper and lower) discrepancy estimates for (concrete) sequences in the unit-cube. In particular we also give an overview of discrepancy estimates for certain classes of hybrid…
An algorithm for constructing a shortest binary k-stage machine generating a given binary sequence is presented. This algorithm can be considered as an extension of Berlekamp-Massey algorithm to the non-linear case.
In the present paper we generate binary pseudorandom sequences using generalized polynomials. A generalized polynomial is a function in whose description we not only allow addition and product (as it is the case in usual polynomials) but…
In this paper, we present a propositional sequent calculus containing disjoint copies of classical and intuitionistic logics. We prove a cut-elimination theorem and we establish a relation between this system and linear logic.
The theme of this article is a "reciprocity" between bounded up-down paths and bounded alternating sequences. Roughly speaking, this ``reciprocity" manifests itself by the fact that the extension of the sequence of numbers of paths of…
A multicomplex, also known as a twisted chain complex, has an associated spectral sequence via a filtration of its total complex. We give explicit formulas for all the differentials in this spectral sequence.
The linear complexity and the $k$-error linear complexity of a binary sequence are important security measures for key stream strength. By studying binary sequences with the minimum Hamming weight, a new tool named as hypercube theory is…
Biclustering involves the simultaneous clustering of objects and their attributes, thus defining local two-way clustering models. Recently, efficient algorithms were conceived to enumerate all biclusters in real-valued datasets. In this…