Results 21 to 30 of about 1,399 (173)
Advances in Discrete Mathematics: From Combinatorics to Cryptography
Turkish Journal of Computer and Mathematics Education (TURCOMAT), 2019 Discrete mathematics forms the foundation for various fields, including computer science and cryptography, by providing essential tools for problem-solving in discrete structures. This paper explores the advancements in discrete mathematics, focusing on combinatorics and cryptography.
Romi Bala, Hemant Pandey
openaire +1 more source
Noncommutative symmetric functions III : Deformations of Cauchy and convolution algebras [PDF]
Discrete Mathematics & Theoretical Computer Science, 1997 [in "Special Issue : Lie Computations", G. Jacob, V. Koseleff, Eds.]
Gérard Duchamp +3 more
doaj +1 more source
Nestings of Matchings and Permutations and North Steps in PDSAWs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2008 We present a simple bijective proof of the fact that matchings of $[2n]$ with N nestings are equinumerous to $\textit{partially directed self avoiding walks}$ confined to the symmetric wedge defined by $y= \pm x$, with $n$ east steps and $N$ north steps.
Martin Rubey
doaj +1 more source
On complete classes of valuated matroids [PDF]
TheoretiCSWe characterize a rich class of valuated matroids, called R-minor valuated matroids that includes the indicator functions of matroids, and is closed under operations such as taking minors, duality, and induction by network.
Edin Husić +3 more
doaj +1 more source
Row-strict quasisymmetric Schur functions [PDF]
Discrete Mathematics & Theoretical Computer Science, 2011 Haglund, Luoto, Mason, and van Willigenburg introduced a basis for quasisymmetric functions called the $\textit{quasisymmetric Schur function basis}$ which are generated combinatorially through fillings of composition diagrams in much the same way as ...
Sarah K Mason, Jeffrey Remmel
doaj +1 more source
Minkowski decompositions of associahedra [PDF]
Discrete Mathematics & Theoretical Computer Science, 2011 Realisations of associahedra can be obtained from the classical permutahedron by removing some of its facets and the set of facets is determined by the diagonals of certain labeled convex planar $n$-gons as shown by Hohlweg and Lange (2007).
Carsten Lange
doaj +1 more source
Influence of the tie-break rule on the end-vertex problem [PDF]
Discrete Mathematics & Theoretical Computer Science, 2014 End-vertices of a given graph search may have some nice properties, as for example it is well known that the last vertex of Lexicographic Breadth First Search (LBFS) in a chordal graph is simplicial, see Rose, Tarjan and Lueker 1976.
Pierre Charbit +2 more
doaj +1 more source
Dynamics of the Picking transformation on integer partitions [PDF]
Discrete Mathematics & Theoretical Computer Science, 2003 This paper studies a conservative transformation defined on families of finite sets. It consists in removing one element from each set and adding a new set composed of the removed elements.
Thi Ha Duong Phan, Eric Thierry
doaj +1 more source
Hypercontractivity on the symmetric group
Forum of Mathematics, SigmaThe hypercontractive inequality is a fundamental result in analysis, with many applications throughout discrete mathematics, theoretical computer science, combinatorics and more.
Yuval Filmus +3 more
doaj +1 more source
Number conserving cellular automata: new results on decidability and dynamics [PDF]
Discrete Mathematics & Theoretical Computer Science, 2003 This paper is a survey on our recent results about number conserving cellular automata. First, we prove the linear time decidability of the property of number conservation. The sequel focuses on dynamical evolutions of number conserving cellular automata.
Bruno Durand +3 more
doaj +1 more source