Related papers: On Multisequences and their extensions
There has been a lot of interest in sufficient dimension reduction (SDR) methodologies as well as nonlinear extensions in the statistics literature. In this note, we use classical results regarding metric spaces and positive definite…
In this expository article we collect the integer sequences that count several different types of matrices over finite fields and provide references to the Online Encyclopedia of Integer Sequences (OEIS). Section 1 contains the sequences,…
We introduce {\it (W')-specification} in terms of language decompositions of subshifts, and show that any recurrence set of a subshift with this property has full Hausdorff dimension. Our main result applies to a wide class of subshifts…
We establish extension theorems for separately holomorphic mappings defined on sets of the form W\setminus M with values in a complex analytic space which possesses the Hartogs extension property. Here W is a 2-fold cross of arbitrary…
Labeled infinite trees provide combinatorial interpretations for many integer sequences generated by nested recurrence relations. Typically, such sequences are monotone increasing. Several of these sequences also have straightforward…
Multisets are sets that allow repetition of elements. As such, multisets pave the way to a number of interesting possibilities of theoretical and applied nature. In the present work, after revising the main aspects of traditional sets, we…
The generalization, similarly to exponential multivariate bases in the Fourier transform, of the Bessel functions to many dimensions is offered. Analogously to the Fourier transform property under the differentiation, the similar Hankel…
The sum-rank metric naturally extends both the Hamming and rank metrics in coding theory over fields. It measures the error-correcting capability of codes in multishot matrix-multiplicative channels (e.g. linear network coding or the…
We discuss the definition and measurability questions of random fractals and find under certain conditions a formula for upper and lower Minkowski dimensions. For the case of a random self-similar set we obtain the packing dimension.
We introduce a new heuristic for the multiple alignment of a set of sequences. The heuristic is based on a set cover of the residue alphabet of the sequences, and also on the determination of a significant set of blocks comprising…
Reduced Rank Regression (RRR) is a widely used method for multi-response regression. However, RRR assumes a linear relationship between features and responses. While linear models are useful and often provide a good approximation, many…
Using the language of Riordan arrays, we look at two related iterative processes on matrices and determine which matrices are invariant under these processes. In a special case, the invariant sequences that arise are conjectured to have…
We find three characterizations for a multidimensional (n+1)-web W possessing a reduct reducible subweb: its closed form equations, the integrability of an invariant distribution associated with W, and the relations between the components…
By classifying infinite-width neural networks and identifying the *optimal* limit, Tensor Programs IV and V demonstrated a universal way, called $\mu$P, for *widthwise hyperparameter transfer*, i.e., predicting optimal hyperparameters of…
The dimension of random simplicial complexes (defined as the maximal dimension among all faces) is a natural extreme value associated with the complex, and is closely related to other functionals defined by a maximum, such as the clique…
We develop several notions of multiplicity for linear factors of multivariable polynomials over different arithmetics (hyperfields). The key example is multiplicities over the hyperfield of signs, which encapsulates the arithmetic of…
This paper studies the problem of high-dimensional multiple testing and sparse recovery from the perspective of sequential analysis. In this setting, the probability of error is a function of the dimension of the problem. A simple…
We give characterizations of radial Fourier multipliers as acting on radial L^p-functions, 1<p<2d/(d+1), in terms of Lebesgue space norms for Fourier localized pieces of the convolution kernel. This is a special case of corresponding…
We suggest a two-matrix model depending on three (infinite) sets of parameters which interpolates between all the models proposed in arXiv:2206.13038, and defined there through $W$-representations. We also discuss further generalizations of…
Results on the spectral behavior of random matrices as the dimension increases are applied to the problem of detecting the number of sources impinging on an array of sensors. A common strategy to solve this problem is to estimate the…