Related papers: Nonsingular Bilinear Maps Revisited
A simplicial set is said to be non-singular if the representing map of each non-degenerate simplex is degreewise injective. The inclusion into the category of simplicial sets, of the full subcategory whose objects are the non-singular…
A family of sequences produced by a non-homogeneous linear recurrence formula derived from the geometry of circles inscribed in lenses is introduced and studied. Mysterious ``underground'' sequences underlying them are discovered in this…
Trilinear mappings appear naturally when performing spatial isogeometric discretizations of degree $p = 1$. Among them, birational maps are characterized by the property that both the mapping and the associated inverse map are rational and…
The multitime multiple recurrences are common in analysis of algorithms, computational biology, information theory, queueing theory, filters theory, statistical physics etc. The theoretical part about them is little or not known. That is…
Recovering the digital input of a time-discrete linear system from its (noisy) output is a significant challenge in the fields of data transmission, deconvolution, channel equalization, and inverse modeling. A variety of algorithms have…
The distributive property can be studied through bilinear maps and various morphisms between these maps. The adjoint-morphisms between bilinear maps establish a complete abelian category with projectives and admits a duality. Thus the…
In this paper we construct infinite families of non-linear maximum rank distance codes by using the setting of bilinear forms of a finite vector space. We also give a geometric description of such codes by using the cyclic model for the…
Kernel approximation via nonlinear random feature maps is widely used in speeding up kernel machines. There are two main challenges for the conventional kernel approximation methods. First, before performing kernel approximation, a good…
A block graph is a graph in which every block is a complete graph. Let $G$ be a block graph and let $A(G)$ be its (0,1)-adjacency matrix. Graph $G$ is called nonsingular (singular) if $A(G)$ is nonsingular (singular). Characterizing…
Singularities appear in numerous important mathematical models used in Physics. And in most of such cases singularities are involved in essentially nonlinear contexts. For more than four decades, general enough nonlinear theories of…
This work presents an initial analysis of using bijective mappings to extend the Theory of Functional Connections to non-rectangular two-dimensional domains. Specifically, this manuscript proposes three different mappings techniques: a)…
A unicellular map is the embedding of a connected graph in a surface in such a way that the complement of the graph is a topological disk. In this paper we present a bijective link between unicellular maps on a non-orientable surface and…
We consider inhomogeneous supersymmetric bilinear forms, i.e., forms that are neither even nor odd. We classify such forms up to dimension seven in the case when the restrictions of the form to the even and odd parts of the superspace are…
We extend a result proved in \cite{Col} for mirror symmetries of planar systems to measure-preserving non-linear reversibilities of $n$-dimensional systems, dropping the analyticity and nondegeneracy conditions.
We construct a family of 17 disjoint axis-parallel line segments in the plane that do not admit a circumscribing polygon.
A fundamental bottleneck in utilising complex machine learning systems for critical applications has been not knowing why they do and what they do, thus preventing the development of any crucial safety protocols. To date, no method exist…
Homeomorphisms allowing us to prove topological equivalences between one-parameter families of maps undergoing the same bifurcation are constructed in this paper. This provides a solution for a classical problem in bifurcation theory that…
The tent map family is arguably the simplest 1-parametric family of maps with non-trivial dynamics and it is still an active subject of research. In recent works the second author, jointly with J. Yorke, studied the graph and backward…
We present three non-equivalent procedures to obtain entwining (non-constant) tetrahedron maps. Given a tetrahedron map, the first procedure incorporates its underlying symmetry group. With the second procedure we obtain several classes of…
Across scientific domains, a fundamental challenge is to characterize and compute the mappings from underlying physical processes to observed signals and measurements. While nonlinear neural networks have achieved considerable success, they…