Enumerative and structural aspects of anagrams without fixed letters

DOI10.54550/ECA2023V3S2R9MaRDI QIDQ6659946zbMATH OpenFDO

Authors Kiril Bangachev

Publication date 9 January 2025

Published in Enumerative Combinatorics and Applications (Search for Journal in Brave)

zbMATH Keywords

HamiltonicitySchur-concavityresidue computationanagrams without fixed lettersanagraphs

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Eulerian and Hamiltonian graphs (05C45) Combinatorial inequalities (05A20)

Recommendations

• On alternating anagrams
• Anagram-free graph colouring
• Anagram-free colorings of graphs
• Anagram-free colourings of graphs
• Alternating anagrams

Cites work

• A note on Schur-concave functions
• A survey on Hamiltonicity in Cayley graphs and digraphs on different groups
• Approximate formulas for some functions of prime numbers
• Computing the permanent modulo a prime power
• Derangements and Laguerre polynomials
• Derangements, Permanents, and Christmas Presents
• Einführung in die Theorie der Gammafunktion.
• Exponential Time Complexity of the Permanent and the Tutte Polynomial
• Hamilton-connected derangement graphs on \(S_ n\)
• Resolving the Hamiltonian problem for vertex-transitive graphs of order a product of two primes
• Root counts of semi-mixed systems, and an application to counting Nash equilibria
• The \(r\)-derangement numbers
• The complexity of computing the permanent
• The maximal number of regular totally mixed Nash equilibria
• Theorems on the residues multinomial coefficients with respect to a prime modulus.
• Über Graphen und ihre Anwendung auf Determinantentheorie und Mengenlehre.

This page was built for publication: Enumerative and structural aspects of anagrams without fixed letters

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6659946)