Related papers: A Construction for Variable Dimension Strong Non-O…
Since some years, non-overlapping sets of strings (also called cross-bifix-free sets) have had an increasing interest in the frame of the researches about Theory of Codes. Recently some non-overlapping sets of strings with variable length…
The non-overlapping sets of pictures are sets such that no two pictures in the set (properly) overlap. They are the generalization to two dimensions of the cross-bifix-free sets of strings. Non-overlapping sets of pictures are…
We define a variable-length code having the property that no (non-empty) prefix of each its codeword is a suffix of any other one, and vice versa. This kind of code can be seen as an extension of two well-known codes in literature, called…
The modern design of industrial structures leads to very complex simulations characterized by nonlinearities, high heterogeneities, tortuous geometries... Whatever the modelization may be, such an analysis leads to the solution to a family…
Two matrices are said non-overlapping if one of them can not be put on the other one in a way such that the corresponding entries coincide. We provide a set of non-overlapping binary matrices and a formula to enumerate it which involves the…
One of the most fundamental topics in subspace coding is to explore the maximal possible value ${\bf A}_q(n,d,k)$ of a set of $k$-dimensional subspaces in $\mathbb{F}_q^n$ such that the subspace distance satisfies $\operatorname{d_S}(U,V) =…
This paper describes an alternative method of generating fixed points of certain substitution systems. This method centres on taking infinite words consisting of one repeated letter per word. These infinite words are then interlaced to form…
High dimensional superposition models characterize observations using parameters which can be written as a sum of multiple component parameters, each with its own structure, e.g., sum of low rank and sparse matrices, sum of sparse and…
Complex systems may morph between structures with different dimensionality and degrees of freedom. As a tool for their modelling, nonlinear embeddings are introduced that encompass objects with different dimensionality as a continuous…
Construction of Symmetric Complex Tight wavelet Frames from Pseudo Splines via Matrix Extension with Symmetry.
We consider the demixing problem of two (or more) high-dimensional vectors from nonlinear observations when the number of such observations is far less than the ambient dimension of the underlying vectors. Specifically, we demonstrate an…
We define a set of binary matrices where any two of them can not be placed one on the other in a way such that the corresponding entries coincide. The rows of the matrices are obtained by means of Dyck words. The cardinality of the set of…
Superregular matrices, i.e., matrices where all square submatrices are non-singular, have a wide range of applications in communications. A superregular block matrix is a broader concept where all full block submatrices, with the…
We analyze the backreaction of dilaton tadpoles on the geometry of non-supersymmetric strings. After finding explicit warped solutions for a T-dual version of the Sugimoto model, we examine the possibility of realizing large extra dimension…
This note describes a technique for generating large non-singular matrices with blocks of full rank. Our motivation to construct such matrices arises in the white-box implementation of cryptographic algorithms with S-boxes.
We give a constructive proof for the superbosonization formula for invariant random matrix ensembles, which is the supersymmetry analog of the theory of Wishart matrices. Formulas are given for unitary, orthogonal and symplectic symmetry,…
In this paper an approach to generate multi-dimensionally consistent $N$-component systems is proposed. The approach starts from scalar multi-dimensionally consistent quadrilateral systems and makes use of the cyclic group. The obtained…
A method of fast linear transform algorithm synthesis for an arbitrary tensor, matrix, or vector is proposed. The method is based on factorization of a tensor and using the factors for building computational structures performing fast…
Constructing active sets is a key part of the Multivariate Decomposition Method. An algorithm for constructing optimal or quasi-optimal active sets is proposed in the paper. By numerical experiments, it is shown that the new method can…
A construction that generates Williamson matrices of order $2n$ from Williamson matrices of odd order $n$ is presented. The construction is completely constructive and only uses three simple sequence operations.