scholarly journals CANONICAL REPRESENTATIVES FOR DIVISOR CLASSES ON TROPICAL CURVES AND THE MATRIX–TREE THEOREM

2014 ◽  
Vol 2 ◽  
Author(s):  
YANG AN ◽  
MATTHEW BAKER ◽  
GREG KUPERBERG ◽  
FARBOD SHOKRIEH

AbstractLet $\def \xmlpi #1{}\def \mathsfbi #1{\boldsymbol {\mathsf {#1}}}\let \le =\leqslant \let \leq =\leqslant \let \ge =\geqslant \let \geq =\geqslant \def \Pr {\mathit {Pr}}\def \Fr {\mathit {Fr}}\def \Rey {\mathit {Re}}\Gamma $ be a compact tropical curve (or metric graph) of genus $g$. Using the theory of tropical theta functions, Mikhalkin and Zharkov proved that there is a canonical effective representative (called a break divisor) for each linear equivalence class of divisors of degree $g$ on $\Gamma $. We present a new combinatorial proof of the fact that there is a unique break divisor in each equivalence class, establishing in the process an ‘integral’ version of this result which is of independent interest. As an application, we provide a ‘geometric proof’ of (a dual version of) Kirchhoff’s celebrated matrix–tree theorem. Indeed, we show that each weighted graph model $G$ for $\Gamma $ gives rise to a canonical polyhedral decomposition of the $g$-dimensional real torus $\mathrm{Pic}^g(\Gamma )$ into parallelotopes $C_T$, one for each spanning tree $T$ of $G$, and the dual Kirchhoff theorem becomes the statement that the volume of $\mathrm{Pic}^g(\Gamma )$ is the sum of the volumes of the cells in the decomposition.


Author(s):  
Haoyi Zhou ◽  
Jun Zhou ◽  
Haichuan Yang ◽  
Cheng Yan ◽  
Xiao Bai ◽  
...  

Imaging devices are of increasing use in environmental research requiring an urgent need to deal with such issues as image data, feature matching over different dimensions. Among them, matching hyperspectral image with other types of images is challenging due to the high dimensional nature of hyperspectral data. This chapter addresses this problem by investigating structured support vector machines to construct and learn a graph-based model for each type of image. The graph model incorporates both low-level features and stable correspondences within images. The inherent characteristics are depicted by using a graph matching algorithm on extracted weighted graph models. The effectiveness of this method is demonstrated through experiments on matching hyperspectral images to RGB images, and hyperspectral images with different dimensions on images of natural objects.



1997 ◽  
Vol 49 (6) ◽  
pp. 1281-1298 ◽  
Author(s):  
Frank Sottile

AbstractPieri’s formula describes the intersection product of a Schubert cycle by a special Schubert cycle on a Grassmannian. We present a new geometric proof, exhibiting an explicit chain of rational equivalences from a suitable sum of distinct Schubert cycles to the intersection of a Schubert cycle with a special Schubert cycle. The geometry of these rational equivalences indicates a link to a combinatorial proof of Pieri’s formula using Schensted insertion.



2019 ◽  
Vol 237 (5) ◽  
pp. 611-620
Author(s):  
M. Bolla ◽  
J. Mala ◽  
A. Elbanna
Keyword(s):  


2017 ◽  
Vol 5 (3) ◽  
pp. 49-63
Author(s):  
Songtao Shang ◽  
Wenqian Shang ◽  
Minyong Shi ◽  
Shuchao Feng ◽  
Zhiguo Hong

The traditional graph-based personal recommendation algorithms mainly depend the user-item model to construct a bipartite graph. However, the traditional algorithms have low efficiency, because the matrix of the algorithms is sparse and it cost lots of time to compute the similarity between users or items. Therefore, this paper proposes an improved video recommendation algorithm based on hyperlink-graph model. This method cannot only improve the accuracy of the recommendation algorithms, but also reduce the running time. Furthermore, the Internet users may have different interests, for example, a user interest in watching news videos, and at the same time he or she also enjoy watching economic and sports videos. This paper proposes a complement algorithm based on hyperlink-graph for video recommendations. This algorithm improves the accuracy of video recommendations by cross clustering in user layers.



2016 ◽  
Vol 24 (11) ◽  
pp. 1957-1968 ◽  
Author(s):  
Jin Wang ◽  
Liang-Chih Yu ◽  
K. Robert Lai ◽  
Xuejie Zhang


2010 ◽  
Vol 06 (02) ◽  
pp. 449-460 ◽  
Author(s):  
BYUNGCHAN KIM

In this brief note, we give combinatorial proofs of two identities involving partial theta functions. As an application, we prove an identity for the product of partial theta functions, first established by Andrews and Warnaar. We also provide a generalization of the first two identities and give a combinatorial proof of the generalized identities.



2015 ◽  
Vol 29 ◽  
pp. 89-101 ◽  
Author(s):  
Swarup Panda ◽  
Dr. Sukanta Pati

Let G be a simple, undirected graph and Gw be the weighted graph obtained from G by giving weights to its edges using a positive weight function w. A weighted graph Gw is said to be nonsingular if its adjacency matrix A(Gw) is nonsingular. In [9], Godsil has given a class $\mathcal{G }$of connected, unweighted, bipartite, nonsingular graphs G with a unique perfect matching, such that A(G)−1 is signature similar to a nonnegative matrix, that is, there exists a diagonal matrix D with diagonal entries ±1 such that DA(G)−1D is nonnegative. The graph associated to the matrix DA(G)−1D is called the inverse of G and it is denoted by G+. The graph G+ is an undirected, weighted, connected, bipartite graph with a unique perfect matching. Nonsingular, unweighted trees are contained inside the class G. We first give a constructive characterization of the class of weighted graphs Hw that can occur as the inverse of some graph G∈\mathcal{ G}. This generalizes Theorem 2.6 of Neumann and Pati[13], where the authors have characterized graphs that occur as inverses of nonsingular, unweighted trees. A weighted graph Gw is said to have the property (R) if for each eigenvalue λ of A(Gw), 1⁄λ is also an eigenvalue of A(Gw). If further, the multiplicity of λ and 1⁄λ are the same, then Gw is said to have property (SR). A characterization of the class of nonsingular, weighted trees Tw with at least 8 vertices that have property (R) was given in [13] under some restriction on the weights. It is natural to ask for such a characterization for the whole of G, possibly with some weaker restrictions on the weights. We supply such a characterization. In particular, for trees it settles an open problem raised in [13].



2014 ◽  
Vol 118 (1201) ◽  
pp. 267-274 ◽  
Author(s):  
D.F. Zhang ◽  
Y.Z. chen

With the development of air traffic, flight delays happen frequently due to bad weather and traffic congestion. The problem can be solved partly by certain strategies, such as changing air routes. However, rerouting leads to a global imbalance in controller workload of current sectors and to an increase in co-ordination workload, and the workloads of some sectors may be beyond the controller’s ability to manage. Thus, airspace sectorisation is expected to migrate from the current static sectors to dynamically-changing ones capable of adapting to traffic demand. Besides addressing imbalance and controlling the increase in workload, the sectorisation has to meet additional geometric constraints such as convexity, connectivity, and minimum distance constraint.



Author(s):  
Xiaoyun Yan ◽  
Yuehuan Wang ◽  
Mengmeng Song ◽  
Man Jiang


2016 ◽  
Vol 24 (2) ◽  
pp. 45-65 ◽  
Author(s):  
Rory Biggs ◽  
Claudiu C. Remsing

AbstractWe consider left-invariant control affine systems on the matrix Lie group SO (2, 1)0. A classification, under state space equivalence, of all such full-rank control systems is obtained. First, we identify certain subsets on which the group of Lie algebra automorphisms act transitively. We then systematically identify equivalence class representatives (for single-input, two-input and three-input control systems). A brief comparison of these classification results with existing results concludes the paper.



Sign in / Sign up

Export Citation Format

Share Document