English
Related papers

Related papers: Classification of some countable descendant-homoge…

200 papers

Kontsevich conjectured that the number f(G,q) of zeros over the finite field with q elements of a certain polynomial connected with the spanning trees of a graph G is polynomial function of q. We have been unable to settle Kontsevich's…

Combinatorics · Mathematics 2007-05-23 Richard P. Stanley

Let X be an algebraic variety with an action of an algebraic group G. Suppose X has a full exceptional collection of sheaves, and these sheaves are invariant under the action of the group. We construct a semiorthogonal decomposition of…

Algebraic Geometry · Mathematics 2015-05-13 Alexei Elagin

By weighted tree we understand such connected tree,that: a) each its vertex and each edge have a positive integer weight; b) the weight of each vertex is equal to the sum of weights of outgoing edges. Each tree has a binary structure --- we…

Combinatorics · Mathematics 2013-10-24 Yury Kochetkov

We consider groups defined by non-empty balanced presentations with the property that each relator is of the form R(x,y), where x and y are distinct generators and R(.,.) is determined by some fixed cyclically reduced word R(a,b) that…

Group Theory · Mathematics 2020-01-14 Johannes Cuno , Gerald Williams

We classify compact homogeneous geometries of irreducible spherical type and rank at least 2 which admit a transitive action of a compact connected group, up to equivariant 2-coverings. We apply our classification to polar actions on…

Group Theory · Mathematics 2014-04-17 Linus Kramer , Alexander Lytchak

Given a compact Riemann surface X with an action of a finite group G, the group algebra Q[G] provides an isogenous decomposition of its Jacobian variety JX, known as the group algebra decomposition of JX. We obtain a method to concretely…

Algebraic Geometry · Mathematics 2016-03-14 Leslie Jiménez

Planar locally finite graphs which are almost vertex transitive are discussed. If the graph is 3-connected and has at most one end then the group of automorphisms is a planar discontinuous group and its structure is well-known. A general…

Group Theory · Mathematics 2009-05-08 M. J. Dunwoody

We prove that the degeneracy of graphs in a hereditary class defined by a finite set S of forbidden induced subgraphs is bounded if and only if S includes a complete graph, a complete bipartite graph and a forest.

Combinatorics · Mathematics 2022-06-22 A. Atminas , V. Lozin

Uniformly finite homology is a coarse invariant for metric spaces; in particular, it is a quasi-isometry invariant for finitely generated groups. In this article, we study uniformly finite homology of finitely generated amenable groups and…

Group Theory · Mathematics 2016-01-20 Matthias Blank , Francesca Diana

We call a triangulated category \emph{hereditary} provided that it is equivalent to the bounded derived category of a hereditary abelian category, where the equivalence is required to commute with the translation functors. If the…

Rings and Algebras · Mathematics 2019-02-19 Xiao-Wu Chen , Claus Michael Ringel

We propose a partitioning of the set of unlabelled, connected cubic graphs into two disjoint subsets named genes and descendants, where the cardinality of the descendants is much larger than that of the genes. The key distinction between…

Combinatorics · Mathematics 2012-09-26 Pouya Baniasadi , Vladimir Ejov , Jerzy Filar , Michael Haythorpe

Every isometry $\sigma$ of a positive-definite even lattice $Q$ can be lifted to an automorphism of the lattice vertex algebra $V_Q$. An important problem in vertex algebra theory and conformal field theory is to classify the…

Quantum Algebra · Mathematics 2015-12-04 Bojko Bakalov , Jason Elsinger

We supply an upper bound on the distinguishing chromatic number of certain infinite graphs satisfying an adjacency property. Distinguishing proper $n$-colourings are generalized to the new notion of distinguishing homomorphisms. We prove…

Combinatorics · Mathematics 2013-09-03 Anthony Bonato , Dejan Delic

We prove a strong dichotomy result for countably-infinite oriented graphs; that is, we prove that for all countably-infinite oriented graphs $G$, either (i) there is a countably-infinite tournament $K$ such that $G\not\subseteq K$, or (ii)…

Combinatorics · Mathematics 2024-05-02 Alistair Benford , Louis DeBiasio , Paul Larson

In this paper we give an explicit algorithm to construct the ordinary quiver of a finite EI category for which the endomorphism groups of all objects have orders invertible in the field k. We classify all finite EI categories with…

Representation Theory · Mathematics 2013-11-07 Liping Li

In this paper, we study uniform rooted plane trees with given degree sequence. We show, under some natural hypotheses on the degree sequence, that these trees converge toward the so-called Inhomogeneous Continuum Random Tree after…

Probability · Mathematics 2025-11-24 Gabriel Berzunza Ojeda , Cecilia Holmgren , Paul Thévenin

Descent polynomials and peak polynomials, which enumerate permutations with given descent and peak sets respectively, have recently received considerable attention. We give several formulas for $q$-analogs of these polynomials which refine…

Combinatorics · Mathematics 2021-11-12 Christian Gaetz , Yibo Gao

Let Q be a finite quiver without sources, and A be the corresponding algebra with radical square zero. We construct an explicit compact generator for the homotopy category of acyclic complexes of projective A-modules. We call such a…

Representation Theory · Mathematics 2016-10-11 Huanhuan Li

We show that every countable cograph has either one or infinitely many siblings. This answers, very partially, a conjecture of Thomass\'e. The main tools are the notion of well quasi ordering and the correspondence between cographs and some…

Combinatorics · Mathematics 2020-04-28 Gena Hahn , Maurice Pouzet , Robert Woodrow

Given a multigraph $G$ whose edges are colored from the set $[q]:=\{1,2,\ldots,q\}$ (\emph{$q$-colored graph}), and a vector $\alpha=(\alpha_1,\ldots,\alpha_{q}) \in \mathbb{N}^{q}$ (\emph{color-constraint}), a subgraph $H$ of $G$ is called…

Data Structures and Algorithms · Computer Science 2025-03-19 P. S. Ardra , Jasine Babu , R. Krithika , Deepak Rajendraprasad