Related papers: Multisequences with high joint nonlinear complexit…

We studied complex interpolation noncommutative Hardy space associated with semi-finite von Neumann algebra and extend Pisier's interpolation theorem for this case.

The autocorrelation values of two classes of binary sequences are shown to be good in [6]. We study the 2-adic complexity of these sequences. Our results show that the 2-adic complexity of such sequences is large enough to resist the attack…

We investigate modularity of elliptic curves over a general totally real number field, establishing a finiteness result for the set non-modular $j$-invariants. By analyzing quadratic points on some modular curves, we show that all elliptic…

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.

Recently, the author, together with L. Leustean and A. Nicolae, introduced the notion of jointly firmly nonexpansive families of mappings in order to investigate in an abstract manner the convergence of proximal methods. Here, we further…

We apply a recently developed measure of multiscale complexity to the Gaussian model consisting of continuous spins with bilinear interactions for a variety of interaction matrix structures. We find two universal behaviors of the complexity…

Random matrices are used in fields as different as the study of multi-orthogonal polynomials or the enumeration of discrete surfaces. Both of them are based on the study of a matrix integral. However, this term can be confusing since the…

We consider a family of determinantal random point processes on the two-dimensional lattice and prove that members of our family can be interpreted as a kind of Gibbs ensembles of nonintersecting paths. Examples include probability measures…

A version of the nonlinear Hodge equations is introduced in which the irrotationality condition is weakened. An elliptic estimate for solutions is derived.

In this paper, a new method is presented to compute the 2-adic complexity of pseudo-random sequences. With this method, the 2-adic complexities of all the known sequences with ideal 2-level autocorrelation are uniformly determined. Results…

In this paper we develop further the multi-parameter model of random simplicial complexes. Firstly, we give an intrinsic characterisation of the multi-parameter probability measure. Secondly, we show that in multi-parameter random…

We investigate the descriptional complexity of operations on semilinear sets. Roughly speaking, a semilinear set is the finite union of linear sets, which are built by constant and period vectors. The interesting parameters of a semilinear…

Power nonnegative matrices are defined as complex matrices having at least one nonnegative integer power. We exploit the possibility of deriving a Perron Frobenius-like theory for these matrices, obtaining three main results and drawing…

This is a report on our long term project to find an algorithm to decide if a finitely presented group has a non-trivial action on a tree.

In this paper, we introduce an iterative process which converges strongly to a common element of sets of solutions of finite family of generalized equilibrium problems, sets of fixed points of finite family of continuous relatively…

There are two main categories of networks that are investigated in the complexity physics community: monopartite and bipartite networks. In this letter, we report a general finding between these two classes. If a random bipartite network is…

We summarize several results about non-simplicity, solvability and normal structure of finite groups related to the number of conjugacy classes appearing in the product or the power of conjugacy classes. We also collect some problems that…

In this study, we introduce the concept of commutative quaternions and commutative quaternion matrices. Firstly, we give some properties of commutative quaternions and their Hamilton matrices. After that we investigate commutative…

We determine a reasonable upper bound for the complexity of collection from the left to multiply two elements of a finite soluble, or polycyclic, group by restricting attention to certain polycyclic presentations of the group.

This work connects two mathematical fields - computational complexity and interval linear algebra. It introduces the basic topics of interval linear algebra - regularity and singularity, full column rank, solving a linear system, deciding…