Related papers: Euclidean rhythm with palindromic rests
Creativity, or the ability to produce new useful ideas, is commonly associated to the human being; but there are many other examples in nature where this phenomenon can be observed. Inspired by this fact, in engineering and particularly in…
The family of trees with palindromic characteristic polynomials is characterized. Large families of graphs with this property are found as well.
In this paper, we use the theory of Riordan matrices to introduce the notion of a Riordan graph. The Riordan graphs are a far-reaching generalization of the well known and well studied Pascal graphs and Toeplitz graphs, and also some other…
The enduring legacy of Euclidean geometry underpins classical machine learning, which, for decades, has been primarily developed for data lying in Euclidean space. Yet, modern machine learning increasingly encounters richly structured data…
We introduce a novel representation of structured polynomial ideals, which we refer to as chordal networks. The sparsity structure of a polynomial system is often described by a graph that captures the interactions among the variables.…
We give a classification of quadratic harmonic morphisms between Euclidean spaces (Theorem 2.4) after proving a Rank Lemma. We also find a correspondence between umbilical (Definition 2.7) quadratic harmonic morphisms and Clifford systems.…
Euclidean distance geometry is the study of Euclidean geometry based on the concept of distance. This is useful in several applications where the input data consists of an incomplete set of distances, and the output is a set of points in…
Biharmonic and conformal-biharmonic maps are two fourth-order generalizations of the well-studied notion of harmonic maps in Riemannian geometry. In this article we consider maps into the Euclidean sphere and investigate a geometric…
We prove a discreteness result for the possible orders of harmonic maps from surfaces to Euclidean buildings; in particular for a building of type $W$ the order is of the form $\frac mk$ where $k$ divides $|W|$. This generalizes, in the…
Presented with a new machine with a specific interconnect topology, algorithm designers use intuition about the symmetry of the algorithm to design time and communication-efficient schedules that map the algorithm to the machine. Is there a…
A periodic lattice in Euclidean space is the infinite set of all integer linear combinations of basis vectors. Any lattice can be generated by infinitely many different bases. This ambiguity was only partially resolved, but standard…
The classical dynamics of the isotropic two-dimensional harmonic oscillator confined by an elliptic hard wall is discussed. The interplay between the harmonic potential with circular symmetry and the boundary with elliptical symmetry does…
This paper deals with a concept for a reconfigurable structure bio-inspired by the cell wall architecture of euglenids, a family of unicellular protists, and based on the relative sliding of adjacent strips. Uniform sliding turns a cylinder…
Diagrammatic techniques to compute perturbatively the spectral properties of Euclidean Random Matrices in the high-density regime are introduced and discussed in detail. Such techniques are developed in two alternative and very different…
We show some of the mathematics that is being developed for the computation of deep inelastic structure functions to three loops. These include harmonic sums, harmonic polylogarithms and a class of difference equations that can be solved…
We introduce a graph structure on Euclidean polytopes. The vertices of this graph are the $d$-dimensional polytopes contained in $\mathbb{R}^d$ and its edges connect any two polytopes that can be obtained from one another by either…
We review the state of the art of the theory of Euclidean random matrices, focusing on the density of their eigenvalues. Both Hermitian and non-Hermitian matrices are considered and links with simpler, standard random matrix ensembles are…
The binary Euclidean algorithm is a variant of the classical Euclidean algorithm. It avoids multiplications and divisions, except by powers of two, so is potentially faster than the classical algorithm on a binary machine. We describe the…
We construct integrals of motion for multidimensional classical systems from ladder operators of one-dimensional systems. This method can be used to obtain new systems with higher order integrals. We show how these integrals generate a…
Binary self-dual codes with large minimum distances, such as the extended Hamming code and the Golay code, are fascinating objects in the coding theory. They are closely related to sporadic simple groups, lattices and invariant theory. A…