相关论文: Birational transformations of weighted graphs

The present work is concerned with characterizing some algebraic invariants of edge ideals of hypergraphs. To this aim, firstly, we introduce some kinds of combinatorial invariants similar to matching numbers for hypergraphs. Then we…

The dynamical degree $\lambda(f)$ of a birational transformation $f$ measures the exponential growth rate of the degree of the formulae that define the $n$-th iterate of $f$. We study the set of all dynamical degrees of all birational…

The increasing demand for Fourier transforms on geometric algebras has resulted in a large variety. Here we introduce one single straight forward definition of a general geometric Fourier transform covering most versions in the literature.…

Following an approach of Dolgachev, Pinkham and Demazure, we classified in math.AG/0210153 normal affine surfaces with hyperbolic $\C^{*}$-actions in terms of pairs of $\Q$-divisors $(D_+,D_-)$ on a smooth affine curve. In the present paper…

We investigate the property of a spatial graph of having a leveled embedding and characterize the abstract graphs with this property. We show that all leveled embeddings are free and we compare leveled and paneled (also known as flat)…

Let $C$ be a smooth curve in $\PP^2$ given by an equation F=0 of degree $d$. In this paper we consider elementary transformations of linear pfaffian representations of $C$. Elementary transformations can be interpreted as actions on a rank…

B. Szegedy [Edge coloring models and reflection positivity, {\sl Journal of the American Mathematical Society} {\bf 20} (2007) 969--988] showed that the number of homomorphisms into a weighted graph is equal to the partition function of a…

We determine all possible triples of depth, dimension, and regularity of edge ideals of weighted oriented graphs with a fixed number of vertices. Also, we compute all the possible Betti table sizes of edge ideals of weighted oriented trees…

A geometric realization of a birational map $\psi$ among two complex projective varieties is a variety $X$ endowed with a $\mathbb{C}^*$-action inducing $\psi$ as the natural birational map among two extremal geometric quotients. In this…

It is well-known that a nonsingular minimal cubic surface is birationally rigid; the group of its birational selfmaps is generated by biregular selfmaps and birational involutions such that all relations between the latter are implied by…

Let X be a smooth or proper variety defined over a finite field. The geometric etale fundamental group of X is a normal subgroup of the Weil group, so conjugation gives it a Weil action. We consider the pro-Q_l-algebraic completion of the…

A matrix-weighted graph is an undirected graph with a $k\times k$ positive semidefinite matrix assigned to each edge. There are natural generalizations of the Laplacian and adjacency matrices for such graphs. These matrices can be used to…

For a graph $\mathbb{Q}=(\mathbb{V},\mathbb{E})$, the transformation graphs are defined as graphs with vertex set being $\mathbb{V(Q)} \cup \mathbb{E(Q)}$ and edge set is described following certain conditions. In comparison to the…

We provide a characterisation of all graphs whose parity binomial edge ideals have pure resolutions. In particular, we show that the minimal free resolution of a parity binomial edge ideal is pure if and only if the corresponding graph is a…

In our previous works (2012, 2013), we provided a finite list of properties characterizing all potential types of quadratic birational transformations of a projective space into a factorial variety, whose base locus is smooth and…

The periodic discrete Toda equation defined over finite fields has been studied. We obtained the finite graph structures constructed by the network of states where edges denote possible time evolutions. We simplify the graphs by introducing…

A classical set of birational invariants of a variety are its spaces of pluricanonical forms and some of their canonically defined subspaces. Each of these vector spaces admits a typical metric structure which is also birationally…

We present a novel spectral embedding of graphs that incorporates weights assigned to the nodes, quantifying their relative importance. This spectral embedding is based on the first eigenvectors of some properly normalized version of the…

In this paper we offer a metric similar to graph edit distance which measures the distance between two (possibly infinite)weighted graphs with finite norm (we define the norm of a graph as the sum of absolute values of its edges). The main…

Suppose a finite, unweighted, combinatorial graph $G = (V,E)$ is the union of several (degree-)regular graphs which are then additionally connected with a few additional edges. $G$ will then have only a small number of vertices $v \in V$…