相关论文: Concurrence of Lorentz-positive maps

Let $T$ be a $C^{1}$ competitive map on a rectangular region $R\subset \mathbb{R}^{2}$. The main results of this paper give conditions which guarantee the existence of an invariant curve $C$, which is the graph of a continuous increasing…

We consider a two-type oriented competition model on the first quadrant of the two-dimensional integer lattice. Each vertex of the space may contain only one particle of either Red type or Blue type. A vertex flips to the color of a…

In this note functions that transform open segments of a linear space into open segments of another linear space are studied and characterized. Assuming that the range is non-collinear, it is proved that such a map can always be expressed…

In 1982, Opsut showed that the competition number of a line graph is at most two and gave a necessary and sufficient condition for the competition number of a line graph being one. In this note, we generalize this result to the competition…

Comparison theorems are foundational to our understanding of the geometric features implied by various curvature constraints. This paper considers manifolds with a positive lower bound on either scalar, 2-Ricci, or Ricci curvature, and…

Let $G$ be a connected $d$-regular graph of order $n$, where $d\geq3$. Let $\lambda_{2}(G)$ be the second largest eigenvalue of $G$. For even $n$, we show that $G$ contains $\left\lfloor\frac{2}{3}(d-\lambda_{2}(G))\right\rfloor$…

An edge-weighted graph $G$, possibly with loops, is said to be antiferromagnetic if it has nonnegative weights and at most one positive eigenvalue, counting multiplicities. The number of graph homomorphisms from a graph $H$ to an…

The competition graph of a digraph D is a graph which has the same vertex set as D and has an edge between x and y if and only if there exists a vertex v in D such that (x,v) and (y,v) are arcs of D. For any graph G, G together with…

We study the outcomes of various positions of the game Snort. When played on graphs admitting an automorphism of order two that maps vertices outside of their closed neighbourhoods (called opposable graphs), the second player has a winning…

We define MC left regular bands and study their adjacency graphs. We prove that for thin MC left regular bands, the adjacency graph is particularly nice and is represented by edge labeled graphs where every simple cycle has an even number…

Suppose A is an open subset of a Carnot group G, where G has a discrete analogue, and H is another Carnot group. We show that a Lipschitz function from A to H whose image has positive Hausdorff measure in the appropriate dimension is…

This manuscript recounts some of the author's contributions to algebraic and enumerative combinatorics. We have focused on two types of generalizations of bipartite maps, which are bipartite graphs embedded on surfaces. Maps are known to…

For a lattice L with 0 and 1, let Princ L denote the ordered set of principal congruences of L. For {0,1}-sublattices A subseteq B of L, congruence generation defines a natural map from Princ A to Princ B. In this way, we obtain a small…

For a set $S$ of vertices of a graph $G$, we define its density $0 \leq \sigma(S) \leq 1$ as the ratio of the number of edges of $G$ spanned by the vertices of $S$ to ${|S| \choose 2}$. We show that, given a graph $G$ with $n$ vertices and…

A metrized graph is a compact singular 1-manifold endowed with a metric. A given metrized graph can be modelled by a family of weighted combinatorial graphs. If one chooses a sequence of models from this family such that the vertices become…

We consider the action of the (combinatorial) Laplacian of a finite and simple graph on integer vectors. By a \emph{Laplacian monopole} we mean an image vector negative at exactly one coordinate associated with a vertex. We consider a…

We study several classes of general non-linear positive maps between C*-algebras, which are not necessary completely positive maps. We characterize the class of the compositions of *-multiplicative maps and positive linear mapsas the class…

In this article we study higher homological properties of $n$-levelled algebras and connect them to properties of the underlying graphs. Notably, to each $2$-representation-finite quadratic monomial algebra $\Lambda$ we associate a…

The competition graph of a digraph D is a (simple undirected) graph which has the same vertex set as D and has an edge between x and y if and only if there exists a vertex v in D such that (x,v) and (y,v) are arcs of D. For any graph G, G…

We construct a local characteristic map to a symplectic manifold M via certain cohomology groups of Hamiltonian vector fields. For each p in M, the Leibniz cohomology of the Hamiltonian vector fields on R^{2n} maps to the Leibniz cohomology…