惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

N
Netflix TechBlog - Medium
T
The Blog of Author Tim Ferriss
aimingoo的专栏
aimingoo的专栏
A
About on SuperTechFans
Stack Overflow Blog
Stack Overflow Blog
B
Blog RSS Feed
Microsoft Security Blog
Microsoft Security Blog
H
Hackread – Cybersecurity News, Data Breaches, AI and More
人人都是产品经理
人人都是产品经理
让小产品的独立变现更简单 - ezindie.com
让小产品的独立变现更简单 - ezindie.com
J
Java Code Geeks
Cyber Security Advisories - MS-ISAC
Cyber Security Advisories - MS-ISAC
B
Blog
MongoDB | Blog
MongoDB | Blog
L
LangChain Blog
WordPress大学
WordPress大学
小众软件
小众软件
IT之家
IT之家
腾讯CDC
月光博客
月光博客
量子位
Blog — PlanetScale
Blog — PlanetScale
P
Proofpoint News Feed
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More

math.CO updates on arXiv.org

Complement Submodular Information Measures for Balanced and Robust Data Selection A Proof of a Conjecture on Positive and Negative Square Energies of Unicyclic Graphs Laplacian Spectrum of the Weakly Zero-Divisor Graph of a Finite Commutative Ring An identity for second Eulerian numbers via lattice-point counting $t$-tone edge coloring of graphs Constructing Maximal Bumpless Pipedreams for Double Grothendieck Polynomials Mubayi's Polynomial-Ideal Conjecture and Cover-Ideal Turán Methods Implicit Binarization via Complex Phase Dynamics in Combinatorial Optimization The limits of Schur multipliers in Pólya conversion problems for the $q$-permanent function Universality theorems for generalized splines Framing Triangulations for Arbitrary Integer Flow Polytopes On the Common Generalization of Gentle Algebras and Framed Directed Acyclic Graphs The complexity of frugal digraph homomorphisms Chaotic and periodic behavior of jeu de taquin on infinite Young tableaux Enumerating Pattern Avoiding Parking Functions Incidence toric ideals and three-point functions Unique Winning Opening Move in Three-Row Chomp Strong majority colorings of graphs A Balancing Theorem for Spanning Trees of Rectangular Grid Graphs Spectral radius and edge-disjoint connected factors of graphs New invariants for rank metric codes, with applications to the classification of rank two semifields of order 256 Flexible DP-4-coloring of planar graphs without 4-cycles and intersecting triangles Balanced intersection size distributions in projective planes List Reconstruction Problem with List Size Two Is Dimensionality a Barrier for Retrieval Models? The INIEP: Irreducible and Positive Realizations The number of Pfaffian orientations on punctured polygonally cellulated surfaces Explicit Construction of Polytopes whose Ehrhart Polynomials Realize any Given Sign Pattern Finite-state enumeration of adjacency-constrained 132-avoiding permutations AMDS and quantum AMDS Constacyclic codes of length $4p^ς$ over $\mathbb{F}_{{p}^{m}}$
Applications of Graded Methods to Cluster Variables in Ar...
Thomas Booker-Price · 2018-03-07 · via math.CO updates on arXiv.org

This thesis is concerned with studying the properties of gradings on several examples of cluster algebras, primarily of infinite type. We first consider two finite type cases: $B_n$ and $C_n$, completing a classification by Grabowski for coefficient-free finite type cluster algebras. We then consider gradings arising from $3 \times 3$ skew-symmetric matrices. We show that the mutation-cyclic matrices give rise to gradings in which all degrees are positive and have only finitely many associated cluster variables (excepting one particular case). For the mutation-acyclic matrices, we prove that all occurring degrees have infinitely many variables. We provide a sufficient condition for a graded cluster algebra generated by a quiver to have infinitely many degrees, based on the presence of a subquiver in its mutation class. We use this to show that the cluster algebras for (quantum) coordinate rings of matrices and Grassmannians contain cluster variables of all degrees in $\mathbb{N}$. Next we consider the list (given by Felikson, Shapiro & Tumarkin) of mutation-finite quivers that do not correspond to triangulations of marked surfaces. We show that $X_7$ gives rise to only two degrees, both with infinitely many variables, and that $\widetilde{E}_6$, $\widetilde{E}_7$ and $\widetilde{E}_8$ give rise to infinitely many variables in some degrees. Finally, we study gradings arising from marked surfaces (see Fomin, Shapiro & Thurston). We adapt a definition by Muller to define the space of valuation functions on such a surface and prove combinatorially that it is isomorphic to the space of gradings on the associated cluster algebra. We illustrate this theory by applying it to the annulus with $n+m$ marked points. We show that the standard grading is of mixed type. We also give an alternative grading in which all degrees have infinitely many cluster variables.