English
Related papers

Related papers: The $F$-triangle of the generalised cluster comple…

200 papers

Taking a Feynman categorical perspective, several key aspects of the geometry of surfaces are deduced from combinatorial constructions with graphs. This provides a direct route from combinatorics of graphs to string topology operations via…

Algebraic Topology · Mathematics 2022-01-26 Clemens Berger , Ralph M. Kaufmann

Factorial k-means (FKM) clustering is a method for clustering objects in a low-dimensional subspace. The advantage of this method is that the partition of objects and the low-dimensional subspace reflecting the cluster structure are…

Statistics Theory · Mathematics 2014-02-14 Yoshikazu Terada

The authors classify the finite index subgroups of R. Thompson's group $F$. All such groups that are not isomorphic to $F$ are non-split extensions of finite cyclic groups by $F$. The classification describes precisely which finite index…

Group Theory · Mathematics 2007-11-08 Collin Bleak , Bronlyn Wassink

The f-invariant is a higher version of the e-invariant that takes values in the divided congruences between modular forms; it can be formulated as an elliptic genus of manifolds with corners of codimension two. In this thesis, we develop a…

Differential Geometry · Mathematics 2009-09-22 Hanno von Bodecker

Let $\mathbb{F}_q$ be the finite field with $q$ elements, and $T$ a positive integer. In this article we find a sharp estimative of the total number of monic irreducible binomials in $\mathbb F_q[x]$ of degree less or equal to $T$, when $T$…

Erickson defined the fusible numbers as a set $\mathcal F$ of reals generated by repeated application of the function $\frac{x+y+1}{2}$. Erickson, Nivasch, and Xu showed that $\mathcal F$ is well ordered, with order type $\varepsilon_0$.…

Combinatorics · Mathematics 2023-05-15 Alexander I. Bufetov , Gabriel Nivasch , Fedor Pakhomov

F-polynomials and g-vectors were defined by Fomin and Zelevinsky to give a formula which expresses cluster variables in a cluster algebra in terms of the initial cluster data. A quantum cluster algebra is a certain noncommutative…

Rings and Algebras · Mathematics 2009-04-22 Thao Tran

We compute the Galois group of the splitting field $F$ of any irreducible and separable polynomial $f(x)=x^6+ax^3+b$ with $a,b\in K$, a field with characteristic different from two. The proofs require to distinguish between two cases:…

Group Theory · Mathematics 2021-10-12 Alberto Cavallo

We use the stabilization functors to study the combinatorial aspects of the $F$-polynomial of a representation of any finite-dimensional basic algebra. We characterize the vertices of their Newton polytopes. We give an explicit formula for…

Representation Theory · Mathematics 2021-08-04 Jiarui Fei

An (additive) functor F from an additive category A to an additive category B is said to be objective, provided any morphism f in A with F(f) = 0 factors through an object K with F(K) = 0. In this paper we concentrate on triangle functors…

Representation Theory · Mathematics 2015-06-19 Claus Michael Ringel , Pu Zhang

We give combinatorial formulas for the Laurent expansion of any cluster variable in any cluster algebra coming from a triangulated surface (with or without punctures), with respect to an arbitrary seed. Moreover, we work in the generality…

Combinatorics · Mathematics 2009-06-04 Gregg Musiker , Ralf Schiffler , Lauren Williams

There are two possible computational interpretations of second-order arithmetic: Girard's system F or Spector's bar recursion and its variants. While the logic is the same, the programs obtained from these two interpretations have a…

Logic in Computer Science · Computer Science 2018-04-04 Valentin Blot

Let F/k be a finite abelian extension of global function fields, totally split at a distinguished place \infty. We prove that a complex Gras conjecture holds for a suitable group of Stark units, and we derive a refined analytic class number…

Number Theory · Mathematics 2012-06-05 Stéphane Viguié

In this paper, we consider universal sums of generalized polygonal numbers. Fixing $m\in\mathbb{N}_{\geq 3}$, we show two finiteness theorems for universal sums of generalized polygonal numbers whose inputs have a restricted number $L$ of…

Number Theory · Mathematics 2026-04-10 Soumyarup Banerjee , Ben Kane , Kwan To Ng

The paper presents some results for reducing the computation of the M\"obius functon of a M\"obius category that arises from a combinatorial inverse semigroup to that of locally finite partially ordered sets. We illustrate the computation…

Combinatorics · Mathematics 2012-10-30 Emil Daniel Schwab , Juan Villarreal

Let $M$ be a closed triangulable manifold, and let $\Delta$ be a triangulation of $M$. What is the smallest number of vertices that $\Delta$ can have? How big or small can the number of edges of $\Delta$ be as a function of the number of…

Combinatorics · Mathematics 2015-05-26 Steven Klee , Isabella Novik

In math.GR/0510298, we showed that every F-quasigroup is linear over a special kind of Moufang loop called an NK-loop. Here we extend this relationship by showing an equivalence between the equational class of (pointed) F-quasigroups and…

Group Theory · Mathematics 2016-08-16 Tomáš Kepka , Michael Kinyon , J. D. Phillips

Cluster algebras are categorified by cluster categories, and $g$-vectors are categorified by the classic index with respect to cluster tilting subcategories. However, the recently introduced completed discrete cluster categories of Dynkin…

Representation Theory · Mathematics 2024-12-17 Francesca Fedele , Peter Jorgensen , Amit Shah

We prove the global triangulation conjecture for families of refined p-adic representations under a mild condition. That is, for a refined family, the associated family of (phi, Gamma)-modules admits a global triangulation on a Zariski open…

Number Theory · Mathematics 2016-02-29 Ruochuan Liu

The problem of finding a nontrivial factor of a polynomial f(x) over a finite field F_q has many known efficient, but randomized, algorithms. The deterministic complexity of this problem is a famous open question even assuming the…

Computational Complexity · Computer Science 2019-02-20 Manuel Arora , Gábor Ivanyos , Marek Karpinski , Nitin Saxena
‹ Prev 1 4 5 6 7 8 10 Next ›