Related papers: Spectral maps associated to semialgebraic branched…

Given a graph E we define E-algebraic branching systems, show their existence and how they induce representations of the associated Leavitt path algebra. We also give sufficient conditions to guarantee faithfulness of the representations…

Classes of branched surfaces extend the classes of surfaces or 2-dimensional manifolds satisfying suitable properties and defined in various manners. Reeb spaces of smooth maps of suitable classes into surfaces whose codimensions are…

In this work we compare the semialgebraic subsets that are images of regulous maps with those that are images of regular maps. Recall that a map f : R n $\rightarrow$ R m is regulous if it is a rational map that admits a continuous…

We describe the structure of those graphs that have largest spectral radius in the class of all connected graphs with a given degree sequence. We show that in such a graph the degree sequence is non-increasing with respect to an ordering of…

A branched covering map of surfaces induces a map in the opposite direction between their arc complexes. We represent a branched covering map combinatorially using what we call a lifting picture, and use this representation to computably…

We consider the homotopy type of maps between symplectic surface whose graphs form symplectic submanifolds of the product. We give a purely topological model for this space in terms of maps with constrained numbers of pre-images. We use…

In graph learning, maps between graphs and their subgraphs frequently arise. For instance, when coarsening or rewiring operations are present along the pipeline, one needs to keep track of the corresponding nodes between the original and…

Biregular bipartite graphs have been proven to have similar edge distributions to random bipartite graphs and thus have nice pseudorandomness and expansion properties. Thus it is quite desirable to find a biregular bipartite spanning…

We use pluriharmonic maps to study representations of fundamental groups of algebraic manifolds. This approach is functorial in the sense that the restriction of such a map to a fiber of a fibration remains pluriharmonic, and on this basis,…

Using the existence of certain symplectic submanifolds in symplectic 4-manifolds, we prove an estimate from above for the number of singular fibers with separating vanishing cycles in minimal Lefschetz fibrations over surfaces of positive…

Let us say that an $n$-sided polygon is semi-regular if it is circumscriptible and its angles are all equal but possibly one, which is then larger than the rest. Regular polygons, in particular, are semi-regular. We prove that semi-regular…

Motivated by the concept of well-covered graphs, we define a graph to be well-bicovered if every vertex-maximal bipartite subgraph has the same order (which we call the bipartite number). We first give examples of them, compare them with…

A necessary and sufficient condition is presented for a graph algebra to satisfy a bracketing identity. The associative spectrum of an arbitrary graph algebra is shown to be either constant or exponentially growing.

The image of the branch set of a PL branched cover between PL $n$-manifolds is a simplicial $(n-2)$-complex. We demonstrate that the reverse implication also holds: an open and discrete map $f \colon \mathbb{S}^n \to \mathbb{S}^n$ with the…

Let $H$ be a connected $m$-uniform hypergraph, and let $\mathcal{A}(H)$ be the adjacency tensor of $H$ whose spectrum is simply called the spectrum of $H$. Let $s(H)$ denote the number of eigenvectors of $\mathcal{A}(H)$ associated with the…

A topological space is called a submetrizable if it can be mapped onto a metrizable topological space by a continuous one-to-one map. In this paper we answer two questions concerning sequence-covering maps on submetrizable spaces.

We provide a detailed description of the maps associated with spectral interlacing, for rank one perturbations and bordering of symmetric and Hermitian matrices. The arguments rely on standard techniques of nonlinear analysis.

Two graphs are co-spectral if their respective adjacency matrices have the same multi-set of eigenvalues. A graph is said to be determined by its spectrum if all graphs that are co-spectral with it are isomorphic to it. We consider these…

A semiregular tree is a tree where all non-pendant vertices have the same degree. Belardo et al. (MATCH Commun. Math. Chem. 61(2), pp. 503-515, 2009) have shown that among all semiregular trees with a fixed order and degree, a graph with…

A bounded set $\Omega \subset \mathbb{R}^d$ is called a spectral set if the space $L^2(\Omega)$ admits a complete orthogonal system of exponential functions. We prove that a cylindric set $\Omega$ is spectral if and only if its base is a…