Related papers: Riemann-Roch for Toric Rank Functions

We use the mirror theorem for toric Deligne-Mumford stacks, proved recently by the authors and by Cheong-Ciocan-Fontanine-Kim, to compute genus-zero Gromov-Witten invariants of a number of toric orbifolds and gerbes. We prove a mirror…

Ranking is a key aspect of many applications, such as information retrieval, question answering, ad placement and recommender systems. Learning to rank has the goal of estimating a ranking model automatically from training data. In…

We introduce the notion of a rank function on a triangulated category $\mathcal{C}$ which generalizes the Sylvester rank function in the case when $\mathcal{C}=\operatorname{Perf}(A)$ is the perfect derived category of a ring $A$. We show…

The paper [Ras15a] introduced distribution-valued games. This game-theoretic model uses probability distributions as payoffs for games in order to express uncertainty about the payoffs. The player's preferences for different payoffs are…

Mapping a locally free module to its l-th tensor power gives rise to a natural map from the Grothendieck group of all locally free modules to the Grothendieck group of all locally free representations of the l-th symmetric group. In this…

We prove that the partition rank and the analytic rank of tensors are equal up to a constant, over finite fields of any characteristic and any large enough cardinality depending on the analytic rank. Moreover, we show that a plausible…

This article contains a complete proof of Gabrielov's rank Theorem, a fundamental result in the study of analytic map germs. Inspired by the works of Gabrielov and Tougeron, we develop formal-geometric techniques which clarify the difficult…

This paper presents our studies on the rearrangement of links from the structure of websites for the purpose of improving the valuation of a page or group of pages as established by a ranking function as Google's PageRank. We build our…

We prove that in the function field setting, $\ell$-torsion in the class groups of quadratic fields can be arbitrarily large. In fact, we explicitly produce a family whose $\ell$-rank growth matches the growth in the setting of genus…

The classical Banach-Mazur game characterizes sets of first category in a topological space. In this work, we show that an effectivized version of the game yields a characterization of sets of effective first category. Using this, we give a…

A class of games for finding a leader among a group of candidates is studied in detail. This class covers games based on coin-tossing and rock-paper-scissors as special cases and its complexity exhibits similar stochastic behaviors: either…

The size function for a number field is an analogue of the dimension of the Riemann-Roch spaces of divisors on an algebraic curve. It was conjectured to attain its maximum at the trivial class of Arakelov divisors. This conjecture was…

We introduce a parametrized version of the Wadge game for functions and show that each lower cone in the Weihrauch degrees is characterized by such a game. These parametrized Wadge games subsume the original Wadge game, the eraser and…

This paper provides a friendly introduction to chip-firing games and graph gonality. We use graphs coming from the five Platonic solids to illustrate different tools and techniques for studying these games, including independent sets,…

In this paper, we discuss a few recent conjectures made by George Beck related to the ranks and cranks of partitions. The conjectures for the rank of a partition were proved by Andrews by using results due to Atkin and Swinnerton-Dyer on a…

An important conjecture in additive combinatorics, number theory, and algebraic geometry posits that the partition rank and analytic rank of tensors are equal up to a constant, over any finite field. We prove the conjecture up to a…

We give a new definition of a $p$-adic $L$-function for a mixed signature character of a real quadratic field and for a nontrivial ray class character of an imaginary quadratic field. We then state a $p$-adic Stark conjecture for this…

Stanley introduced the concept of chromatic symmetric functions of graphs which extends and refines the notion of chromatic polynomials of graphs, and asked whether trees are determined up to isomorphism by their chromatic symmetric…

In this paper we consider positional games where the winning sets are tree universal graphs. Specifically, we show that in the unbiased Maker-Breaker game on the complete graph $K_n$, Maker has a strategy to occupy a graph which contains…

We introduce a new family of higher-rank graphs, whose construction was inspired by the graphical techniques of Lambek \cite{Lambek} and Johnstone \cite{Johnstone} used for monoid and category emedding results. We show that they are planar…