Results 101 to 110 of about 8,473 (239)
On the automorphisms of the power semigroups of a numerical semigroup
Transactions of the London Mathematical Society, Volume 13, Issue 1, December 2026.Abstract If H$H$ is a numerical semigroup (i.e., a cofinite subset of the non‐negative integers closed under addition), then the collection of all non‐empty subsets of H$H$ forms a semigroup P(H)$\mathcal {P}(H)$ under the sumset operation induced by addition in H$H$.
Salvatore Tringali, Kerou Wen
wiley +1 more source
Some new families of compositions based on big part restrictions [PDF]
Discrete Mathematics Letters, 2022 Augustine O. Munagi, Mark Shattuck
doaj +1 more source
Discrete Mathematics, 2013 AbstractWe provide a bijective proof of the identity ∑x∈λ(h(x)2−c(x)2)=|λ|2 where λ is an integer partition, h(x) is the hook number of the cell x∈λ, and c(x) is the content of x. A closely related identity is also proved bijectively.
openaire +2 more sources
Inverse problems for semilinear elliptic PDE with a general nonlinearity a(x,u)$a(x,u)$
Transactions of the London Mathematical Society, Volume 13, Issue 1, December 2026.Abstract This article studies the inverse problem of recovering a nonlinearity in an elliptic equation Δu+a(x,u)=0$\Delta u + a(x,u) = 0$ from boundary measurements of solutions. Previous results based on first‐order linearization achieve this under a sign condition on ∂ua(x,u)$\partial _u a(x,u)$, and results based on higher order linearization ...
David Johansson +2 more
wiley +1 more source
Bijections for partition identities
Journal of Combinatorial Theory, Series A, 1988 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Bijections behind the Ramanujan Polynomials
Advances in Applied Mathematics, 2001 The Ramanujan polynomials were introduced by Ramanujan in his study of power series inversions. In an approach to the Cayley formula on the number of trees, Shor discovers a refined recurrence relation in terms of the number of improper edges, without realizing the connection to the Ramanujan polynomials.
William Y. C. Chen, Victor J. W. Guo
openaire +3 more sources
Context‐free graphs and their transition groups
Transactions of the London Mathematical Society, Volume 13, Issue 1, December 2026.Abstract Starting from context‐free inverse graphs, we introduce a new class of groups and study their structural properties. We establish closure properties, show that their coword problems are context‐free, analyze torsion elements, and realize them as subgroups of the asynchronous rational group.
Daniele D'Angeli +3 more
wiley +1 more source
Combinatorial Generation Algorithms for Directed Lattice Paths
MathematicsGraphs are a powerful tool for solving various mathematical problems. One such task is the representation of discrete structures. Combinatorial generation methods make it possible to obtain algorithms that can create discrete structures with specified ...
Yuriy Shablya +2 more
doaj +1 more source
A Coarse Geometric Approach to Graph Layout Problems
Journal of Graph Theory, Volume 113, Issue 2, Page 169-194, October 2026.ABSTRACT We define a range of new coarse geometric invariants based on various graph–theoretic measures of complexity for finite graphs, including treewidth, pathwidth, cutwidth and bandwidth. We prove that, for bounded degree graphs, these invariants can be used to define functions which satisfy a strong monotonicity property, namely, they are ...
Wanying Huang +3 more
wiley +1 more source
A bijection for the evolution of $B$-trees
CoRR17 pages, 2 figures, accepted by 35th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2024)
Burghart, Fabian, Wagner, Stephan
openaire +6 more sources