Related papers: Comments on "A New Method to Compute the 2-Adic Co…

We develop a new approach to deformation quantizations of Lie bialgebras and Poisson structures which goes in two steps. In the first step one associates to any Poisson (resp. Lie bialgebra) structure a so called quantizable Poisson (resp.…

We report a novel approach for the efficient computation of solutions of a broad class of large-scale systems of non-linear ordinary differential equations, describing aggregation kinetics. The method is based on a new take on the…

Performance and complexity of sequential decoding of polarization-adjusted convolutional (PAC) codes is studied. In particular, a performance and computational complexity comparison of PAC codes with 5G polar codes and convolutional codes…

Complexity of patterns is a key information for human brain to differ objects of about the same size and shape. Like other innate human senses, the complexity perception cannot be easily quantified. We propose a transparent and universal…

We apply a Bethe-Peierls approach to statistical-mechanics models defined on random networks of arbitrary degree distribution and arbitrary correlations between the degrees of neighboring vertices. Using the NP-hard optimization problem of…

All binary self-dual [44,22,8] codes with an automorphism of order 3 or 7 are classified. In this way we complete the classification of extremal self-dual codes of length 44 having an automorphism of odd prime order.

We consider a problem of decomposition of a ternary function into a composition of binary ones from the viewpoint of communication complexity and algorithmic information theory as well as some applications to cellular automata.

We derive bifurcation test equations for A-series singularities of nonlinear functionals and, based on these equations, we propose a numerical method for detecting high codimensional bifurcations in parameter-dependent PDEs such as…

The (classical) crosscorrelation is an important measure of pseudorandomness of two binary sequences for applications in communications. The arithmetic crosscorrelation is another figure of merit introduced by Goresky and Klapper…

Understanding natural phenomenon through the interactions of different complex systems has become an increasing focus in scientific inquiry. Defining complexity and actually measuring it is an ongoing debate and no standard framework has…

The problem of whether and how one can compute the twin-width of a graph -- along with an accompanying contraction sequence -- lies at the forefront of the area of algorithmic model theory. While significant effort has been aimed at…

We consider the homeomorphic classification of finite-dimensional continua as well as several related equivalence relations. We show that, when $n \geq 2$, the classification problem of $n$-dimensional continua is strictly more complex than…

Computational studies of basic models of strongly-correlated electron systems can provide guidance in the search for new materials as well as insight into the physical mechanisms responsible for their properties. Here, we illustrate this by…

Invariants of general linear system of two hyperbolic partial differential equations (PDEs) are derived under transformations of the dependent and independent variables by real infinitesimal method earlier. Here a subclass of the general…

We provide first a categorical exploration of, and then completion of the mapping of the relationships among, three fundamental perspectives on binary relations: as the incidence matrices of hypergraphs, as the formal contexts of concept…

We investigate the complexity of bilevel combinatorial optimization with uncertainty in the follower's objective, in a robust optimization approach. We show that the robust counterpart of the bilevel problem under interval uncertainty can…

In this paper, a low-complexity approach for the automorphism ensemble decoder (AED) using successive cancellation (SC) as constituent decoders is proposed. The approach sequentially activates sub-decoders and terminates the decoding…

The paper concerns two versions of the notion of real forms of Lie superalgebras. One is the standard approach, where a real form of a complex Lie superalgebra is a real Lie superalgebra such that its complexification is the original…

In 2012, Diem introduced a new figure of merit for cryptographic sequences called expansion complexity. In this paper, we slightly modify this notion to obtain the so-called irreducible-expansion complexity which is more suitable for…

This is a technical report, containing all the theorem proofs and additional evaluations in paper "Efficient Identification of Additive Link Metrics via Network Tomography" by Liang Ma, Ting He, Kin K. Leung, Don Towsley, and Ananthram…