Results 91 to 100 of about 2,715,033 (227)
Combinatorics of partial wreath power of finite inverse symmetric semigroup $\mathcal{IS}_d$ [PDF]
Algebra and Discrete Mathematics, Number 1. (2007). pp. 49 - 61, 2020 We study some combinatorial properties of partial wreath $k$-th power of the semigroup $\mathcal{IS}_d$. In particular, we calculate its order, the number of idempotents and the number of D-classes.
arxiv
On a Question of Erdős and Nešetřil About Minimal Cuts in a Graph
Journal of Graph Theory, Volume 108, Issue 4, Page 817-818, April 2025.ABSTRACT Answering a question of Erdős and Nešetřil, we show that the maximum number of inclusion‐wise minimal vertex cuts in a graph on n $n$ vertices is at most 1.889 9 n $1.889{9}^{n}$ for large enough n $n$.
Domagoj Bradač
wiley +1 more source
An extension to overpartitions of Rogers-Ramanujan identities for even moduli [PDF]
Discrete Mathematics & Theoretical Computer Science, 2006 We investigate class of well-poised basic hypergeometric series $\tilde{J}_{k,i}(a;x;q)$, interpreting these series as generating functions for overpartitions defined by multiplicity conditions.
Sylvie Corteel +2 more
doaj +1 more source
Discrete model of Yang-Mills equations in Minkowski space [PDF]
Cubo A Mathematical Journal, Vol. 6, No. 2 (2004), pp. 35-50, 2004 Using methods of differential geometry, a discrete analog of the Yang-Mills equations in Minkowski space is constructed. The gauge transformation law in a discrete formulation is given and gauge invariance of discrete Yang-Mills equations is studied. Difference self-dual and anti-self-dual equations with respect to the Lorentz metric are presented.
arxiv
Combinatorics and Geometry of Transportation Polytopes: An Update [PDF]
, 2013 A transportation polytope consists of all multidimensional arrays or tables of non-negative real numbers that satisfy certain sum conditions on subsets of the entries.
De Loera, Jesús A., Kim, Edward D.
core
Relative cubulation of relative strict hyperbolization
Journal of the London Mathematical Society, Volume 111, Issue 4, April 2025.Abstract We prove that many relatively hyperbolic groups obtained by relative strict hyperbolization admit a cocompact action on a CAT(0)$\operatorname{CAT}(0)$ cubical complex. Under suitable assumptions on the peripheral subgroups, these groups are residually finite and even virtually special.
Jean‐François Lafont, Lorenzo Ruffoni
wiley +1 more source
Pattern avoidance in dynamical systems [PDF]
Discrete Mathematics & Theoretical Computer Science, 2008 Orbits generated by discrete-time dynamical systems have some interesting combinatorial properties. In this paper we address the existence of forbidden order patterns when the dynamics is generated by piecewise monotone maps on one-dimensional closed ...
José María Amigó +2 more
doaj +1 more source
Complexity problems in enumerative combinatorics [PDF]
arXiv, 2018 We give a broad survey of recent results in Enumerative Combinatorics and their complexity aspects.
arxiv
A central limit theorem for the matching number of a sparse random graph
Journal of the London Mathematical Society, Volume 111, Issue 4, April 2025.Abstract In 1981, Karp and Sipser proved a law of large numbers for the matching number of a sparse Erdős–Rényi random graph, in an influential paper pioneering the so‐called differential equation method for analysis of random graph processes. Strengthening this classical result, and answering a question of Aronson, Frieze and Pittel, we prove a ...
Margalit Glasgow +3 more
wiley +1 more source
APPLICATION OF COMBINATORICS IN DISCRETE MATHEMATICS AND ALGORITHMS
Combinatorics, as a branch of discrete mathematics, studies combinatorial structures and methods of their analysis. Its core tools, such as permutations, combinations, and placements, play a key role in various fields, including algorithms, optimization, cryptography, and graph theory. In this article, we will look at how combinatorics is used to solve
openaire +2 more sources