Related papers: Spectral maps associated to semialgebraic branched…
Semilinear maps are a generalization of linear maps between vector spaces where we allow the scalar action to be twisted by a ring homomorphism such as complex conjugation. In particular, this generalization unifies the concepts of linear…
For a nonnegative integer $k$, a graph $G$ is said to be $k$-factor-critical if $G-Q$ admits a perfect matching for any $Q\subseteq V(G)$ with $|Q|=k$. In this article, we prove spectral radius conditions for the existence of…
We prove that the set of proper ideals of a monoid endowed with coarse lower topology is a spectral space.
We give examples of harmonic maps between negatively curved manifolds with special properties. These negatively curved manifolds do not have the homotopy type of a locally symmetric space.
A graph $G$ is called well-covered if all maximal independent sets of vertices have the same cardinality. A well-covered graph $G$ is called uniformly well-covered if there is a partition of the set of vertices of $G$ such that each maximal…
Graph $G$ is $F$-saturated if $G$ contains no copy of graph $F$ but any edge added to $G$ produces at least one copy of $F$. One common variant of saturation is to remove the former restriction: $G$ is $F$-semi-saturated if any edge added…
A branched covering surface-knot is a surface-knot in the form of a branched covering over an oriented surface-knot $F$, where we include the case when the covering has no branch points. A branched covering surface-knot is presented by a…
We show that a nef line bundle on a proper scheme over an excellent base is semiample if and only if it is semiample after restricting to characteristic zero and to positive characteristic. In the process of the proof, we provide a…
For a smooth map $f:X^4\to\Sigma^2$ that is locally modeled by holomorphic maps, the domain is shown to admit a symplectic structure that is symplectic on some regular fiber, if and only if $f^*[\Sigma]\ne0$. If so, the space of symplectic…
Fractional (hyper-)graph theory is concerned with the specific problems that arise when fractional analogues of otherwise integer-valued (hyper-)graph invariants are considered. The focus of this paper is on fractional edge covers of…
We characterize locally injective semialgebraic maps between two semialgebraic sets in terms of the induced homomorphism between their rings of (continuous) semialgebraic functions.
We call a (not necessarily planar) embedding of a graph $G$ in the plane \emph{sequential} if its vertices lie in $\mathbb Z^2$ and the line segments between adjacent vertices contain no interior integer points. In this note, we prove (i) a…
The overlap graphs of subtrees of a tree are equivalent to subtree filament graphs, the overlap graphs of subtrees of a star are cocomparability graphs, and the overlap graphs of subtrees of a caterpillar are interval filament graphs. In…
We show the existence of polynomial maps which have a regular bifurcation value, while over a neighbourhood of this value the fibres are connected and diffeomorphic.
We introduce the set $\mathcal{G}^{\rm SSP}$ of all simple graphs $G$ with the property that each symmetric matrix corresponding to a graph $G \in \mathcal{G}^{\rm SSP}$ has the strong spectral property. We find several families of graphs…
In this note, we prove that an affine cellular algebra $A$ is semisimple if and only if the scheme associated to $A$ is reduced and 0-dimensional, and the bilinear forms with respect to all layers of $A$ are isomorphisms. Moreover, if the…
The notion of spectral localizer is extended to pairings with semifinite spectral triples. By a spectral flow argument, any semifinite index pairing is shown to be equal to the signature of the spectral localizer. As an application, a…
One of the important features of an interconnection network is its ability to efficiently simulate programs or parallel algorithms written for other architectures. Such a simulation problem can be mathematically formulated as a graph…
A graph is prime (with respect to the split decomposition) if its vertex set does not admit a partition (A,B) (called a split) with |A|, |B| >= 2 such that the set of edges joining A and B induces a complete bipartite graph. We prove that…
A graph parameter is self-dual in some class of graphs embeddable in some surface if its value does not change in the dual graph by more than a constant factor. We prove that the branchwidth of connected hypergraphs without bridges and…