相关论文: Fighting Fish: enumerative properties
Tropical geometry with the max-plus algebra has been applied to statistical learning models over tree spaces because geometry with the tropical metric over tree spaces has some nice properties such as convexity in terms of the tropical…
We study the Fisher model describing natural selection in a population with a diploid structure of a genome by differential- geometric methods. For the selection dynamics we introduce an affine connection which is shown to be the…
Tropical Geometry and Mathematical Morphology share the same max-plus and min-plus semiring arithmetic and matrix algebra. In this chapter we summarize some of their main ideas and common (geometric and algebraic) structure, generalize and…
Jigsaw puzzle solving, the problem of constructing a coherent whole from a set of non-overlapping unordered visual fragments, is fundamental to numerous applications, and yet most of the literature of the last two decades has focused thus…
Adversarial examples in machine learning are typically generated using gradients, obtained either directly through access to the model or approximated via queries to it. In this paper, we propose a much simpler approach to craft adversarial…
Karonski, Luczak, and Thomason (2004) conjectured that, for any connected graph G on at least three vertices, there exists an edge weighting from {1,2,3} such that adjacent vertices receive different sums of incident edge weights.…
Food webs represent the set of consumer-resource interactions among a set of species that co-occur in a habitat, but most food web studies have omitted parasites and their interactions. Recent studies have provided conflicting evidence on…
Given two baric algebras $(A_1,\omega_1)$ and $(A_2,\omega_2)$ we describe a way to define a new baric algebra structure over the vector space $A_1\oplus A_2$, which we shall denote $(A_1\bowtie A_2,\omega_1\bowtie\omega_2)$. We present…
We characterize the extremal trees that maximize the number of almost-perfect matchings, which are matchings covering all but one or two vertices, and those that maximize the number of strong almost-perfect matchings, which are matchings…
Jaramillo Puentes et al. give a Grothendieck-Witt valued floor-diagram formula for rational curves in smooth toric del Pezzo surfaces with simple and quadratic double point conditions. We study its dependence on the choice of merge…
This paper introduces a new structure of commutative semiring, generalizing the tropical semiring, and having an arithmetic that modifies the standard tropical operations, i.e. summation and maximum. Although our framework is combinatorial,…
Inspired by the group structure on $S^1/ \bbZ$, we introduce a weak hopfish structure on an irrational rotation algebra $A$ of finite Fourier series. We consider a class of simple $A$-modules defined by invertible elements, and we compute…
A recurring theme in the least squares approach to phylogenetics has been the discovery of elegant combinatorial formulas for the least squares estimates of edge lengths. These formulas have proved useful for the development of efficient…
Mutual imitation games among artificial birds are studied. By employing a variety of mappings and game rules, the evolution to the edge between chaos and windows is universally confirmed. Some other general features are observed, including…
Topology of exponential and scale-free trees and simple graphs is investigated numerically. The numbers of the nearest neighbors, the next-nearest neighbors, the next-next-nearest neighbors, the 4-th and the 5-th neighbors are calculated.…
The aim of this paper is to develop the combinatorics of constructions associated to what we call \emph{triangular partitions}. As introduced in arXiv:2102.07931, these are the partitions whose cells are those lying below the line joining…
An arithmetical structure on a graph is given by a labeling of the vertices which satisfies certain divisibility properties. In this note, we look at several families of graphs and attempt to give counts on the number of arithmetical…
In this paper, we study two examples of minimum weight random graphs with edge constraints. First we consider the complete graph on ${n}$ vertices equipped with uniformly heavy edge weights and use iteration methods to obtain deviation…
In this paper we will first introduce the notion of affine structures on a ringed space and then obtain several properties. Affine structures on a ringed space, arising mainly from complex analytical spaces of algebraic schemes over number…
We study the statistical properties of piecewise expanding maps in the general setting of metric measure spaces. We provide sufficient conditions for exponential mixing of such systems with explicit estimates on the constants. We also…