Related papers: Multisequences with high joint nonlinear complexit…

In this paper, starting from a generalized coherent (i.e. avoiding uniform loss) intervalvalued probability assessment on a finite family of conditional events, we construct conditional probabilities with quasi additive classes of…

A typical complex system should be described by a supernetwork or a network of networks, in which the networks are coupled to some other networks. As the first step to understanding the complex systems on such more systematic level,…

Binary multirelations generalise binary relations by associating elements of a set to its subsets. We study the structure and algebra of multirelations under the operations of union, intersection, sequential and parallel composition, as…

Acyclic networks are a class of complex networks in which links are directed and don't have closed loops. Here we present an algorithm for transforming an ordinary undirected complex network into an acyclic one. Further analysis of an…

An infinite permutation is a linear order on the set N. We study the properties of infinite permutations generated by fixed points of some uniform binary morphisms, and find the formula for their complexity.

Research efforts of the past fifty years have led to a development of linear integer programming as a mature discipline of mathematical optimization. Such a level of maturity has not been reached when one considers nonlinear systems subject…

Homomorphism duality pairs play crucial role in the theory of relational structures and in the Constraint Satisfaction Problem. The case where both classes are finite is fully characterized. The case when both side are infinite seems to be…

We introduce the iteration theory for periodic billiard trajectories in a compact and convex domain of the Euclidean space, and we apply it to establish a multiplicity result for non-iterated trajectories.

Linear time-invariant systems are very popular models in system theory and applications. A fundamental problem in system identification that remains rather unaddressed in extant literature is to leverage commonalities amongst related linear…

When supersymmetry is spontaneously broken it will be generically non-linearly realized. A method to describe the non-linear realization of supersymmetry is with constrained superfields. We discuss the basic features of this description and…

Although most knots are nonalternating, modern research in knot theory seems to focus on alternating knots. We consider here nonalternating knots and their properties. Specifically, we show certain classes of knots have nontrivial Jones…

A new approach to constructing the noncommutative scalar field theory is presented. Not only between x_i and p_j, we impose commutation relations between x_is as well as p_js, and give a new representation of x_i,p_js. We carry out both…

This paper gives the linear complexity of binary Ding-Helleseth generalized cyclotomic sequences of any order.

We classify the finite groups whose non-linear irreducible characters that are not conjugate under the natural Galois action have distinct degrees, therefore extending the results in Berkovich et al. [Proc. Amer. Math. Soc. {\bf 115}…

This paper investigates the expected number of complex roots of nonlinear equations. Those equations are assumed to be analytic, and to belong to certain inner product spaces. Those spaces are then endowed with the Gaussian probability…

We show that the expected value for the linear complexity of $m$-multisequences of length $n$ is E_n^{(m)} = n m/(m+1) + O(1).

In this work some nonlinear integral equation is studied. This equation has arisen in the (super)string field theory and cosmology. In this work it is proved that some boundary problem for this equation has a solution.

We examine the convergence properties of sequences of nonnegative real numbers that satisfy a particular class of recursive inequalities, from the perspective of proof theory and computability theory. We first establish a number of results…

In this note, we extend the result of \cite{PoulyG16} about the complexity of solving polynomial differential equations over unbounded domains to work with non-rational input. In order to deal with arbitrary input, we phrase the result in…

Evaluating joint probabilities of potential outcomes and observed variables, and their linear combinations, is a fundamental challenge in causal inference. This paper addresses the bounding and identification of these probabilities in…