Related papers: Comments on "A New Method to Compute the 2-Adic Co…
We show new upper and lower bounds for the complexity of implementation of a sequence of Boolean matrices proposed by Kaski et al. (arXiv:1208.0554) with additive circuits.
We reduce the problem of proving deterministic and nondeterministic Boolean circuit size lower bounds to the analysis of certain two-dimensional combinatorial cover problems. This is obtained by combining results of Razborov (1989),…
We derive weighted summation identities involving the second order recurrence sequence $\{w_n\} =\{ w_n(a,b; p, q)\}$ defined by $w_0 = a,\,w_1 = b;\,w_n = pw_{n - 1} - qw_{n - 2}\, (n \ge 2)$, where $a$, $b$, $p$ and $q$ are arbitrary…
We study orthogonal decompositions of symmetric and ordinary tensors using methods from linear algebra. For the field of real numbers we show that the sets of decomposable tensors can be defined be equations of degree 2. This gives a new…
In this work we recall Pansiot's result on the complexity of pure morphic sequences and we use the tools developed by Devyatov for morphic sequences to prove the decidability of the complexity class of pure morphic sequences.
The duality and other symmetry properties of the effective conductivity sigma_e of the classical two-dimensional isotropic randomly inhomogeneous heterophase systems at arbitrary number of phases N are discussed. A new approach for a…
A new algorithms for computing discrete logarithms on elliptic curves defined over finite fields is suggested. It is based on a new method to find zeroes of summation polynomials. In binary elliptic curves one is to solve a cubic system of…
The Lie linearizability criteria are extended to complex functions for complex ordinary differential equations. The linearizability of complex ordinary differential equations is used to study the linearizability of corresponding systems of…
The paper is an implementation in low dimensional cases of the classification method presented before by Rakhimov and Bekbaev. We give a complete classification of a subclass of complex filiform Leibniz algebras obtained from the naturally…
In this article, we introduce the first degrees of a cochain complex associated to a strict Lie 2-group whose cohomology is shown to extend the classical cohomology theory of Lie groups. In particular, we show that the second cohomology…
We have developed a novel method to describe superradiance and related cooperative and collective effects in a closed form. Using the method we derive a two-atom master equation in which any complexity of atomic levels, semiclassical…
The goal of this article is to study closed connected sets of periodic solutions, of autonomous second order Hamiltonian systems, emanating from infinity. The main idea is to apply the degree for SO(2)-equivariant gradient operators defined…
Approaches to automated grouping in singular spectrum analysis are considered. A new method for the identification of periodic components is proposed. The possibilities of extensions to multivariate time series and images are discussed.
It is shown that each subgroup of odd index in an alternating group of degree at least 10 has all insoluble composition factors to be alternating. A classification is then given of 2-arc-transitive graphs of odd order admitting an…
We investigate the complexity of logistic regression models which is defined by counting the number of indistinguishable distributions that the model can represent (Balasubramanian, 1997). We find that the complexity of logistic models with…
In this note, we prove a conjecture proposed by Tao Zhang, Shuxing Li, Tao Feng and Gennian Ge, IEEE Transaction on Information Theory, vol. 60, no. 5, May 2014. This conjecture is about the cross correlation distribution of ternary…
This paper classifies the complexity of various teaching models by their position in the arithmetical hierarchy. In particular, we determine the arithmetical complexity of the index sets of the following classes: (1) the class of uniformly…
We present a rigorous and relatively fast method for the computation of the "complexity" of a natural number (sequence A005245), and answer some "old and new" questions related to the question in the title of this note. We also extend the…
A two-dimensional configuration is a coloring of the infinite grid Z^2 with finitely many colors. For a finite subset D of Z^2, the D-patterns of a configuration are the colored patterns of shape D that appear in the configuration. The…
Topological filters via sheaves generalize the classical linear translation-invariant filter theory by attaching the filter computation locally to a simplicial topological space. This paper develops topological filters for causal signal…