Related papers: Riemann-Roch for Toric Rank Functions
This note is a follow up of math.AG/0612267v2 and it is largely inspired by a beautiful description of Baker-Norine of non-effective degree (g-1) divisors via chip-firing game. We consider the set of all theta characteristics on a tropical…
We consider a family of distributions on which natural tail orders can be constructed upon a representation of a distribution by a (single) hyper-real number. Past research revealed that the ordering can herein strongly depend on the…
Motivated by work of Stembridge, we study rank functions for Viennot's heaps of pieces. We produce a simple and sufficient criterion for a heap to be a ranked poset and apply the results to the heaps arising from fully commutative words in…
This paper presents an algorithm for generating all imaginary and unusual discriminants up to a fixed degree bound that define a quadratic function field of positive 3-rank. Our method makes use of function field adaptations of a method due…
In this paper, we survey and study definitions and properties of tropical polynomials, tropical rational functions and in general, tropical meromorphic functions, emphasizing practical techniques that can really carry out computations. For…
We study two-player games with alternating moves played on infinite trees. Our main focus is on the case where the trees are full (regular) and the winning set is open (with respect to the product topology on the tree). Gale and Stewart…
One of the major outstanding conjectures in the study of chromatic symmetric functions (CSF's) states that trees are uniquely determined by their CSF's. Though verified on graphs of order up to twenty-nine, this result has been proved only…
Graph classes of bounded tree rank were introduced recently in the context of the model checking problem for first-order logic of graphs. These graph classes are a common generalization of graph classes of bounded degree and bounded…
Recent work of Qi et al. arXiv:2004.11240v7 proposes a set of axioms for tensor rank functions. The current paper presents examples showing that their axioms allow rank functions to have some undesirable properties, and a stronger set of…
In this paper we study generating functions resembling the rank of strongly unimodal sequences. We give combinatorial interpretations, identities in terms of mock modular forms, asymptotics, and a parity result. Our functions imitate a…
We study skew polycyclic codes over a finite field $\mathbb{F}_q$, associated with a skew polynomial $f(x) \in \mathbb{F}_q[x;\sigma]$, where $\sigma$ is an automorphism of $\mathbb{F}_q$. We start by proving the Roos-like bound for both…
In this paper we demonstrate that the class of basic feasible functionals has recursion theoretic properties which naturally generalize the corresponding properties of the class of feasible functions. We also improve the Kapron - Cook…
Using specializations of unfold and fold on a generic tree data type we derive unranking and ranking functions providing natural number encodings for various Hereditarily Finite datatypes. In this context, we interpret unranking operations…
In this work we discuss a random Tug-of-War game in graphs where one of the players has the power to decide at each turn whether to play a round of classical random Tug-of-War, or let the other player choose the new game position in…
We establish a Hirzebruch-Riemann-Roch type theorem and Grothendieck-Riemann-Roch type theorem for matrix factorizations on quotient Deligne-Mumford stacks. For this we first construct a Hochschild-Kostant-Rosenberg type isomorphism…
We consider a real-valued function $f$ defined on the set of infinite branches $X$ of a countably branching pruned tree $T$. The function $f$ is said to be a \textit{limsup function} if there is a function $u \colon T \to \mathbb{R}$ such…
We describe a formal correctness proof of RANKING, an online algorithm for online bipartite matching. An outcome of our formalisation is that it shows that there is a gap in all combinatorial proofs of the algorithm. Filling that gap…
The feasibility of a classification-by-rank program for modular categories follows from the Rank-Finiteness Theorem. We develop arithmetic, representation theoretic and algebraic methods for classifying modular categories by rank. As an…
Let $I_{G} \subset K[x_{1},...,x_{m}]$ be the toric ideal associated to a finite graph $G$. In this paper we study the binomial arithmetical rank and the $G$-homogeneous arithmetical rank of $I_G$ in 2 cases: $G$ is bipartite, $I_G$ is…
We introduce a search game for two players played on a "scenario" consisting of a ground set together with a collection of feasible partitions. This general setting allows us to obtain new characterisations of many width parameters such as…