Related papers: Tensor-generated fractals: Using tensor decomposit…
The Rauzy fractal is a domain in the two-dimensional plane constructed by the Rauzy substitution, a substitution rule on three letters. The Rauzy fractal has a fractal-like boundary, and the currently known its constructions is not only for…
This paper proposes fast randomized algorithms for computing the Kronecker Tensor Decomposition (KTD). The proposed algorithms can decompose a given tensor into the KTD format much faster than the existing state-of-the-art algorithms. Our…
To help understand the underlying mechanisms of neural networks (NNs), several groups have, in recent years, studied the number of linear regions $\ell$ of piecewise linear functions generated by deep neural networks (DNN). In particular,…
Orthogonal array and a large set of orthogonal arrays are important research objects in combinatorial design theory, and they are widely applied to statistics, computer science, coding theory and cryptography. In this paper, some new series…
Labyrinth fractals are self-similar dendrites in the unit square that are defined with the help of a labyrinth set or a labyrinth pattern. In the case when the fractal is generated by a horizontally and vertically blocked pattern, the arc…
To any spectral triple (A,D,H) a dimension d is associated, in analogy with the Hausdorff dimension for metric spaces. Indeed d is the unique number, if any, such that |D|^-d has non trivial logarithmic Dixmier trace. Moreover, when d is…
We define a new structure on a space endowed with convexities, and call it a fractoconvex structure (or, a space with fractoconvexity). We introduce two operations on a set of fractoconvexities and in a special case we show that they…
Consider $k\ge 2$ distinct, linearly independent, homogeneous linear recurrences of order $k$ satisfying the same recurrence relation. We prove that the recurrences are related to a decomposable form of degree $k$, and there is a very broad…
We propose a novel method for the construction of orthogonal arrays. The algorithm makes use of the Kronecker Product operator in association with unit column vectors to generate new orthogonal arrays from existing orthogonal arrays. The…
We derive a Kronecker product approximation for the micromagnetic long range interactions in a collocation framework by means of separable sinc quadrature. Evaluation of this operator for structured tensors (Canonical format, Tucker format,…
This preliminary paper presents initial explorations in rendering Iterated Function System (IFS) fractals using a differentiable rendering pipeline. Differentiable rendering is a recent innovation at the intersection of computer graphics…
Matrices can be decomposed via rank-one approximations: the best rank-one approximation is a singular vector pair, and the singular value decomposition writes a matrix as a sum of singular vector pairs. The singular vector tuples of a…
Tensors or {\em multi-way arrays} are functions of three or more indices $(i,j,k,\cdots)$ -- similar to matrices (two-way arrays), which are functions of two indices $(r,c)$ for (row,column). Tensors have a rich history, stretching over…
We consider finite approximations of a fractal generated by an iterated function system of affine transformations on $\mathbb{R}^d$ as a discrete set of data points. Considering a signal supported on this finite approximation, we propose a…
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.
Third-order tensors are widely used as a mathematical tool for modeling physical properties of media in solid state physics. In most cases, they arise as constitutive tensors of proportionality between basic physics quantities. The…
It is wellknown that the ordinary calculus is inadequate to handle fractal structures and processes and another suitable calculus needs to be developed for this purpose. Recently it was realized that fractional calculus with suitable…
Exponential growth describes an extremely rapid process ubiquitous across mathematics and diverse physical, biological, and technological systems. Here, we introduce a class of fractal-inspired lattices that combine long-range periodic…
Tensor Kronecker products, the natural generalization of the matrix Kronecker product, are independently emerging in multiple research communities. Like their matrix counterpart, the tensor generalization gives structure for implicit…
Fractals are defined as geometric shapes that exhibit symmetry of scale. This simply implies that fractal is a shape that it would still look the same even if somebody could zoom in on one of its parts an infinite number of times. This…