Related papers: A Construction for Variable Dimension Strong Non-O…
In this work we present an algorithm to construct sparse-paving matroids over finite set $S$. From this algorithm we derive some useful bounds on the cardinality of the set of circuits of any Sparse-Paving matroids which allow us to prove…
We give a sufficient condition for a non-commutative association scheme to have a fusion association scheme, and construct non-commutative association schemes from symmetric balanced generalized weighing matrices and generalized Hadamard…
We rephrase the Wootters-Fields construction [Ann. Phys., {\bf 191}, 363 (1989)] of a full set of mutually unbiased bases in a complex vector space of dimensions $N=p^r$, where $p$ is an odd prime, in terms of the character vectors of the…
We investigate structured sparsity methods for variable selection in regression problems where the target depends nonlinearly on the inputs. We focus on general nonlinear functions not limiting a priori the function space to additive…
A method to construct and count all the linear codes (of arbitrary length) in $\mathbb{F}_{4}$ that are invariant under reverse permutation and that contain the repetition code is presented. These codes are suitable for constructing DNA…
Compared with co-prime integers, co-prime integer matrices are more challenging due to the non-commutativity. In this paper, we present a new family of pairwise co-prime integer matrices of any dimension and large size. These matrices are…
Orthogonal array, a classical and effective tool for collecting data, has been flourished with its applications in modern computer experiments and engineering statistics. Driven by the wide use of computer experiments with both qualitative…
A procedure for the construction and the classification of multilattices in arbitrary dimension is proposed. The algorithm allows to determine explicitly the location of the points of a multilattice given its space group, and to determine…
We study the properties of ultrametric matrices aiming to design methods for fast ultrametric matrix-vector multiplication. We show how to encode such a matrix as a tree structure in quadratic time and demonstrate how to use the resulting…
In this talk, I discuss our recent work concerning the construction of non-supersymmetric heterotic string models which have exponentially suppressed dilaton tadpoles and cosmological constants, and thus greatly enhanced stability…
Multidimensional Scaling (MDS) is a classic technique that seeks vectorial representations for data points, given the pairwise distances between them. However, in recent years, data are usually collected from diverse sources or have…
A systematic way of construction of (2+1)-dimensional dispersionless integrable Hamiltonian systems is presented. The method is based on the so-called central extension procedure and classical R-matrix applied to the Poisson algebras of…
The main contribution of this paper is a constructive method for building separable multivariate vector-valued wavelet bases in the general framework of \( L^2(\mathbb{R}^d, \mathbb{R}^m) \) for any \( d, m \geq 1 \). While separable…
A novel method to obtain parametrizations of complex inverse orthogonal matrices is provided. These matrices are natural generalizations of complex Hadamard matrices which depend on non zero complex parameters. The method we use is via…
We formulate matrix models for strings in ten dimensional pp-wave backgrounds and for particles in eleven dimensional ones. This is done by first characterizing the deformations of ten dimensional {\cal N}=1 SYM which are induced by a…
The use of nonstandard methods to characterize properties of weak, strong and mixed extensions of congruences to ultrafilters has been the main topic of several recent papers. We show that similar methods can be used to characterize the…
It is shown the construction of a module structure [2] with universe over a set of a particular kind of mathematical proofs, the base ring of this module will be built on a maximal consistent extension of a set of propositions, this…
In the present work, we propose a new set of coherent structures that arise in nonlinear dynamical lattices with more than one components, namely interlaced solitons. These are waveforms in which in the relevant anti-continuum limit, i.e.…
A given subset $A$ of natural numbers is said to be complete if every element of $\N$ is the sum of distinct terms taken from $A$. This topic is strongly connected to the knapsack problem which is known to be NP complete. The main goal of…
This paper introduces a new systematic algorithm for constructing periodic Euclidean weaving diagrams with combinatorial arguments. It is shown that such a weaving diagram can be considered as a specific type of four-regular periodic planar…