English
Related papers

Related papers: Combinatorics of Labelled Parallelogram polyominoe…

200 papers

Frobenius companion matrices arise when we write an $n$-th order linear ordinary differential equation as a system of first order differential equations. These matrices and their transpose have very nice properties. By using the powers of…

Exactly Solvable and Integrable Systems · Physics 2025-03-10 Metin Gürses , Aslı Pekcan

For line arrangements in P^2 with nice combinatorics (in particular, for those which are nodal away the line at infinity), we prove that the combinatorics contains the same information as the fundamental group together with the meridianal…

Algebraic Topology · Mathematics 2014-10-01 A. D. R. Choudary , A. Dimca , S. Papadima

Given a morphism of (small) groupoids with injective object map, we provide sufficient and necessary conditions under which the induction and co-induction functors between the categories of linear representations are naturally isomorphic. A…

Representation Theory · Mathematics 2019-03-13 Juan Jesús Barbarán Sánchez , Laiachi EL Kaoutit

Let $L_{n}$ be the free Lie algebra, $F_{n}$ be the free metabelian Lie algebra, and $L_{n,c}$ be the free metabelian nilpotent of class $c$ Lie algebra of rank $n$ generated by $x_1,\ldots,x_n$ over a field $K$ of characteristic zero. We…

Rings and Algebras · Mathematics 2020-03-17 Sehmus Findik , Nazar Sahin Oguslu

Let $f(x_1,...,x_k)$ be a polynomial over a field $K$. This paper considers such questions as the enumeration of the number of nonzero coefficients of $f$ or of the number of coefficients equal to $\alpha\in K^*$. For instance, if $K=\ff_q$…

Combinatorics · Mathematics 2008-11-25 Tewodros Amdeberhan , Richard P. Stanley

Consider factorizations into transpositions of an n-cycle in the symmetric group S_n. To every such factorization we assign a monomial in variables w_{ij} that retains the transpositions used, but forgets their order. Summing over all…

Combinatorics · Mathematics 2009-02-24 Yurii Burman , Dimitri Zvonkine

Given a pair of number fields with isomorphic rings of adeles, we construct bijections between objects associated to the pair. For instance we construct an isomorphism of Brauer groups that commutes with restriction. We additionally…

Group Theory · Mathematics 2018-11-14 Benjamin Linowitz , D. B. McReynolds , Nicholas Miller

In this paper we investigate a family of matroids introduced by Ardila and Billey to study one-dimensional intersections of complete flag arrangements of $\mathbb{C}^n$. The set of lattice points $P_n$ inside the equilateral triangle $S_n$…

Combinatorics · Mathematics 2018-11-20 Felix Gotti , Harold Polo

The linear induced matching width (LMIM-width) of a graph is a width parameter defined by using the notion of branch-decompositions of a set function on ternary trees. In this paper we study output-polynomial enumeration algorithms on…

Data Structures and Algorithms · Computer Science 2015-09-16 Petr A. Golovach , Pinar Heggernes , Mamadou Moustapha Kanté , Dieter Kratsch , Sigve H. Sæther , Yngve Villanger

We present a general method for analytically factorizing the n-fold form factor integrals $f^{(n)}_{N,N}(t)$ for the correlation functions of the Ising model on the diagonal in terms of the hypergeometric functions…

Mathematical Physics · Physics 2015-05-27 M. Assis , J-M. Maillard , B. M. McCoy

This thesis deals with the enumerative study of combinatorial maps, and its application to the enumeration of other combinatorial objects. Combinatorial maps, or simply maps, form a rich combinatorial model. They have an intuitive and…

Combinatorics · Mathematics 2016-10-03 Wenjie Fang

Given a symmetric polynomial $P$ in $2n$ variables, there exists a unique symmetric polynomial $Q$ in $n$ variables such that \[ P(x_1,\ldots,x_n,x_1^{-1},\ldots,x_n^{-1}) =Q(x_1+x_1^{-1},\ldots,x_n+x_n^{-1}). \] We denote this polynomial…

The parametrization theorem is derived in a flat nD pseudo-complex affine space. The pseudo-complex hyperbolic space accomodates n-number of uncompactified time-like extra dimensions with sugnature (s,r), where s and r are the numbers of…

Differential Geometry · Mathematics 2010-03-02 Minh Q. Truong

For a graph embedded into a surface, we relate many combinatorial parameters of the cycle matroid of the graph and the bond matroid of the dual graph with the topological parameters of the embedding. This will give an expression of the…

Combinatorics · Mathematics 2015-03-17 R. Askanazi , S. Chmutov , C. Estill , J. Michel , P. Stollenwerk

Motivated by the bijection between Schnyder labelings of a plane triangulation and partitions of its inner edges into three trees, we look for binary labelings for quadrangulations (whose edges can be partitioned into two trees). Our…

Combinatorics · Mathematics 2020-07-21 Stefan Felsner , Clemens Huemer , Sarah Kappes , David Orden

A numerical semigroup is an additive subsemigroup of the non-negative integers. In this paper, we consider parametrized families of numerical semigroups of the form $P_n = \langle f_1(n), \ldots, f_k(n) \rangle$ for polynomial functions…

Commutative Algebra · Mathematics 2020-05-20 Franklin Kerstetter , Christopher O'Neill

The automorphisms of the symmetrized polydisc $\mathbb G_n$ are well-known and are given in the coordinates of the polydisc in \cite{E:Z}. We find an explicit formula for the automorphisms of $\mathbb G_n$ in its own coordinates. If $\tau$…

Functional Analysis · Mathematics 2021-10-13 Bappa Bisai , Sourav Pal

In this paper, we analyze the stochastic properties of some large size (area) polyominoe's perimeter such that the directed column-convex polyomino, the column-convex polyomino, the directed diagonally-convex polyomino, the staircase (or…

Probability · Mathematics 2020-01-07 Guy Louchard

This paper studies signed graphs with possible outer-edges. We introduce and investigate the chain group, the boundary operator, the co-boundary operator, the flow group, the tension group, the homology group, the cohomology group, with…

Combinatorics · Mathematics 2025-10-13 Beifang Chen

A prime labeling on a graph of order $m$ is an assignment of $\{ 1, 2, \ldots, m \}$ to the vertices of the graph such that each pair of adjacent vertices has coprime labels. The ladder of order $2n$ is the $2 \times n$ grid graph graph…

Combinatorics · Mathematics 2023-06-08 Stephen J. Curran , M. A. Ollis