1 citations · 1 across the 8 of their papers we have counts for
9 papers
Shape changing identities for permuted-basement nonsymmetric Macdonald polynomials
Guilherme Zeus Dantas e Moura, Olya Mandelshtam
Permuted-basement Macdonald polynomials are nonsymmetric generalizations of symmetric Macdonald polynomials that form a basis for the polynomial ring $\math…
Probabilistic Entry Swapping Bijections for Non-Attacking Fillings
Guilherme Zeus Dantas e Moura, Olya Mandelshtam
Non-attacking fillings are combinatorial objects central to the theory of Macdonald polynomials. A probabilistic bijection for partition-shaped non-attacking fillings was introduce…
An invitation to Fibonacci digits
Justin Cheigh, Guilherme Zeus Dantas e Moura, Jacob Lehmann Duke +6
The purpose of this short note is to show the interplay between math outreach and conducting original research, in particular how each can build off the other.
Cluster Monomials in Graph Laurent Phenomenon Algebras
Guilherme Zeus Dantas e Moura, Ramanuja Charyulu Telekicherla Kandalam, Dora Woodruff
Laurent phenomenon algebras, first introduced by Lam and Pylyavskyy, are a generalization of cluster algebras that still possess many salient features of cluster algebras. Graph La…
Outerplanar Turán number of a cycle
Ervin Győri, Guilherme Zeus Dantas e Moura, Runtian Zhou
A graph is outerplanar if it has a planar drawing for which all vertices belong to the outer face of the drawing. Let be a graph. The outerplanar Turán number of , denoted b…
On generic universal rigidity on the line
Guilherme Zeus Dantas e Moura, Tibor Jordán, Corwin Silverman
A -dimensional bar-and-joint framework with underlying graph is called universally rigid if all realizations of with the same edge lengths, in all dimensions, ar…
Towards the Gaussianity of Random Zeckendorf Games
Justin Cheigh, Guilherme Zeus Dantas e Moura, Ryan Jeong +4
Zeckendorf proved that any positive integer has a unique decomposition as a sum of non-consecutive Fibonacci numbers, indexed by . Motiva…
Sum and Difference Sets in Generalized Dihedral Groups
Ruben Ascoli, Justin Cheigh, Guilherme Zeus Dantas e Moura +6
Given a group , we say that a set has more sums than differences (MSTD) if , has more differences than sums (MDTS) if , or is sum-d…
Recurrence Relations for -Legal Index Difference Sequences
Guilherme Zeus Dantas e Moura, Andrew Keisling, Astrid Lilly +4
Zeckendorf's Theorem implies that the Fibonacci number is the smallest positive integer that cannot be written as a sum of non-consecutive previous Fibonacci numbers. Catral…