English
Related papers

Related papers: On counting plurifibered varieties

200 papers

We give explicit computations for the variance of the number of points along one-parameter families of cubic curves. We highlight evaluations of variances that involve Jacobsthal sums.

Number Theory · Mathematics 2025-04-23 Bogdan Nica

We study the problem of approximately counting the number of list packings of a graph. The analogous problem for usual vertex coloring and list coloring has attracted a lot of attention. For list packing the setup is similar but we seek a…

Combinatorics · Mathematics 2024-02-07 Evan Camrud , Ewan Davies , Alex Karduna , Holden Lee

We extend the notion of an enumeration scheme developed by Zeilberger and Vatter to the case of vincular patterns (also called "generalized patterns" or "dashed patterns"). In particular we provide an algorithm which takes in as input a set…

Combinatorics · Mathematics 2012-01-17 Andrew M. Baxter , Lara K. Pudwell

We extend Schaeffer's bijection between rooted quadrangulations and well-labeled trees to the general case of Eulerian planar maps with prescribed face valences, to obtain a bijection with a new class of labeled trees, which we call…

Combinatorics · Mathematics 2007-05-23 J. Bouttier , P. Di Francesco , E. Guitter

In this paper, we explore some generalizations of a counting problem related to tilings in grids of size 2xn, which was originally posed as a question on Mathematics Stack Exchange (Question 3972905). In particular, we consider this problem…

Discrete Mathematics · Computer Science 2024-06-25 José L. Ramírez , Diego Villamizar

We offer streamlined proofs of fundamental theorems regarding the index theory for partial self-maps of an infinite set that are bijective between cofinite subsets.

Combinatorics · Mathematics 2015-10-09 P. L. Robinson

We consider the problem of enumeration of incongruent two-color bracelets of $n$ beads, $k$ of which are black, and study several natural variations of this problem. We also give recursion formulas for enumeration of $t$-color bracelets,…

Combinatorics · Mathematics 2011-05-06 Vladimir Shevelev

Maximal chord diagrams up to all isomorphisms are enumerated. The enumerating formula is based on a bijection between rooted one-vertex one-face maps on locally orientable surfaces and a certain class of symmetric chord diagrams. This…

Combinatorics · Mathematics 2018-05-15 Evgeniy Krasko

There are many extremely challenging problems about existence of monochromatic arithmetic progressions in colorings of groups. Many theorems hold only for abelian groups as results on non-abelian groups are often much more difficult to…

Combinatorics · Mathematics 2014-11-11 Erik Sjöland

We consider the question of computing the distribution of a permutation statistics over restricted permutations via enumeration schemes. The restricted permutations are those avoiding sets of vincular patterns (which include both classical…

Combinatorics · Mathematics 2014-01-03 Andrew M. Baxter

Given a fibration in groupoids d : D -> I, we define a fibered multicategory as a particular functor p : M -> I, where M has the same objects as D, and its arrows a : X -> Y should be thought of as families of arrows in the multicategory,…

Category Theory · Mathematics 2022-01-07 Claudio Pisani

This paper is the first part in a series of three papers devoted to the study of enumerative invariants of abelian surfaces through the tropical approach. In this paper, we consider the enumeration of genus $g$ curves of fixed degree…

Algebraic Geometry · Mathematics 2024-11-27 Thomas Blomme

The meander problem is a combinatorial problem which provides a toy model of the compact folding of polymer chains. In this paper we study various questions relating to the enumeration of meander diagrams, using diagrammatical methods. By…

High Energy Physics - Theory · Physics 2007-05-23 M. G. Harris

We give an example of a finitely based locally finite variety which has uncountably many term clones. (Such varieties were known before.)

Rings and Algebras · Mathematics 2007-05-23 Martin Goldstern

The number of tree-rooted maps, that is, rooted planar maps with a distinguished spanning tree, of size $n$ is C(n)C(n+1) where C(n)=binomial(2n,n)/(n+1) is the nth Catalan number. We present a (long awaited) simple bijection which explains…

Combinatorics · Mathematics 2009-06-18 Olivier Bernardi

In this thesis, we develop the theory of bifibrations of polycategories. We start by studying how to express certain categorical structures as universal properties by generalising the shape of morphism. We call this phenomenon…

Category Theory · Mathematics 2023-05-25 Nicolas Blanco

We describe the problem of aggregating the label predictions of diverse classifiers using a class taxonomy. Such a taxonomy may not have been available or referenced when the individual classifiers were designed and trained, yet mapping the…

Artificial Intelligence · Computer Science 2015-12-02 Amrita Saha , Sathish Indurthi , Shantanu Godbole , Subendhu Rongali , Vikas C. Raykar

We study the problem of counting the total number of affine solutions of a system of n binomials in n variables over an algebraically closed field of characteristic zero. We show that we may decide in polynomial time if that number is…

Commutative Algebra · Mathematics 2007-05-23 Eduardo Cattani , Alicia Dickenstein

We generalize to vector bundles the techniques introduced for line bundles in prior work of the author with Liu, Osserman and Zhang. We then use this method to prove the injectivity of the Petri map for vector bundles and the surjectivity…

Algebraic Geometry · Mathematics 2023-06-27 Montserrat Teixidor i Bigas

In this paper we investigate multifractal decompositions based on values of Birkhoff averages of functions from a class of symbolically continuous functions. This will be done for an expanding interval map with infinitely many branches and…

Dynamical Systems · Mathematics 2013-02-08 Ai-Hua Fan , Thomas Jordan , Lingmin Liao , Michal Rams