Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · math/0512437

A simple symmetry generating operads related to rooted planar $m$-ary trees and polygonal numbers

Leroux Philippe
View original source ↗Read source document ↗Export metadata ↓

Abstract

The aim of this paper is to further explore an idea from J.-L. Loday briefly exposed in [5]. We impose a natural and simple symmetry on a unit action over the most general quadratic relation which can be written. This leads us to two families of binary, quadratic and regular operads whose free objects, as well as their duals in the sense of Ginzburg and Kapranov are computed. Roughly speaking, free objects found here are in relation to $m$-ary trees, triangular numbers and more generally $m$-tetrahedral numbers, homogeneous polynomials on $m$ commutative indeterminates over a field $K$ and polygonal numbers. Involutive connected P-Hopf algebras are constructed and a link to genomics is discussed. We also propose in conclusion some open questions.

Explore related subjects

math.COmath.QA

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Leroux Philippe. 2005-12-19. A simple symmetry generating operads related to rooted planar $m$-ary trees and polygonal numbers. https://arxiv.org/abs/math/0512437

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO↗
arXiv2026

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO↗