相关论文: Riemann-Roch for Toric Rank Functions
These notes survey some basic results in toric varieties over a field with examples and applications. A computer algebra package (written by the second author) is described which deals with both affine and projective toric varieties in any…
In the present paper we obtain a new homological version of the implicit function theorem and some versions of the Darboux theorem. Such results are proved for continuous maps on topological manifolds. As a consequence, some versions of…
This paper presents a complete axiomatization of Monadic Second-Order Logic (MSO) over infinite trees. MSO on infinite trees is a rich system, and its decidability ("Rabin's Tree Theorem") is one of the most powerful known results…
Early and reliable detection of cognitive decline is one of the most important challenges of current healthcare. In this project we developed an approach whereby a frequently played computer game can be used to assess a variety of cognitive…
Using semi-tensor product of matrices, the structures of several kinds of symmetric games are investigated via the linear representation of symmetric group in the structure vector of games as its representation space. First of all, the…
We investigate tree-automatic well-founded trees. Using Delhomme's decomposition technique for tree-automatic structures, we show that the (ordinal) rank of a tree-automatic well-founded tree is strictly below omega^omega. Moreover, we make…
We use Hodge theory to prove a new upper bound on the ranks of Mordell-Weil groups for elliptic curves over function fields after regular geometrically Galois extensions of the base field, improving on previous results of Silverman and…
In cooperative game theory, games in partition function form are real-valued function on the set of so-called embedded coalitions, that is, pairs $(S,\pi)$ where $S$ is a subset (coalition) of the set $N$ of players, and $\pi$ is a…
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…
Covering spaces of graphs have long been useful for studying expanders (as "graph lifts") and unique games (as the "label-extended graph"). In this paper we advocate for the thesis that there is a much deeper relationship between…
Topological fixpoint logics are a family of logics that admits topological models and where the fixpoint operators are defined with respect to the topological interpretations. Here we consider a topological fixpoint logic for relational…
We prove that, up to homeomorphism, any graph subject to natural necessary conditions on orientation and the cycle rank can be realized as the Reeb graph of a Morse function on a given closed manifold $M$. Along the way, we show that the…
Reachability games are two-player games played on a graph, where the objective of $\texttt{REACH}$ player is to reach the target set whereas the objective of $\texttt{SAFE}$ player is to stay away from the target set. Reachability games…
We examine so-called rank function equations and their solutions consisting of non-nilpotent matrices. Secondly, we present some geometrical properties of the set of solutions to certain rank function equations in the nilpotent case.
We show that an algorithmic construction of sequences of recursive trees leads to a direct proof of the convergence of random recursive trees in an associated Doob-Martin compactification; it also gives a representation of the limit in…
The aim of the current work is to prove a law of large numbers for the range size of recurrent rotor walks with random initial configuration on a general class of trees, called periodic trees or directed covers of graphs.
Recently, much attention has been given to various inequalities among partition functions. For example, Nicolas, {and later DeSavlvo--Pak,} proved that $p(n)$ is eventually log-concave, and Ji--Zang showed that the cranks are eventually…
This paper studies how to use relation algebras, which are useful for high-level specification and verification, for proving the correctness of lower-level array-based implementations of algorithms. We give a simple relation-algebraic…
Under some mild assumptions, an orientation-preserving branched covering map of marked $2$-spheres induces a pullback map between the corresponding Teichm\"uller spaces. By analyzing the associated pushforward operator acting on integrable…
Prolog's ability to return multiple answers on backtracking provides an elegant mechanism to derive reversible encodings of combinatorial objects as Natural Numbers i.e. {\em ranking} and {\em unranking} functions. Starting from a…