Zobrazeno 1 - 10
of 21
pro vyhledávání: '"Ahlbach, Connor"'
If one attaches shifted copies of a skew tableau to the right of itself and rectifies, at a certain point the copies no longer experience vertical slides, a phenomenon called tableau stabilization. While tableau stabilization was originally developed
Externí odkaz:
http://arxiv.org/abs/2009.02644
Autor:
Ahlbach, Connor
We introduce tableau stabilization, a new phenomenon and statistic on Young tableaux based on jeu de taquin. We investigate bounds for tableau stabilization, the shape of stabilized tableaux, and tableau stabilization as a permutation statistic. We a
Externí odkaz:
http://arxiv.org/abs/1907.00105
Autor:
Ahlbach, Connor, Swanson, Joshua P.
We show that the cyclic sieving phenomenon of Reiner--Stanton--White together with necklace generating functions arising from work of Klyachko offer a remarkably unified, direct, and largely bijective approach to a series of results due to Kraskiewic
Externí odkaz:
http://arxiv.org/abs/1808.06043
Autor:
Ahlbach, Connor, Swanson, Joshua
Publikováno v:
European Journal of Combinatorics, Volume 73, October 2018, pages 37 to 60
Reiner-Stanton-White defined the cyclic sieving phenomenon (CSP) associated to a finite cyclic group action and a polynomial. A key example arises from the length generating function for minimal length coset representatives of a parabolic quotient of
Externí odkaz:
http://arxiv.org/abs/1706.08631
We study the delay (also known as depth) of circuits that simulate finite automata, showing that only certain growth rates (as a function of the number $n$ of steps simulated) are possible. A classic result due to Ofman (rediscovered and popularized
Externí odkaz:
http://arxiv.org/abs/1308.2970
In this paper, we apply the combinatorial proof technique of Description, Involution, Exceptions (DIE) to prove various known identities for the joint cumulant. Consider a set of random variables $S = \{X_1,..., X_n\} $. Motivated by the definition o
Externí odkaz:
http://arxiv.org/abs/1211.0652
We study the problem of addition and subtraction using the Zeckendorf representation of integers. We show that both operations can be performed in linear time; in fact they can be performed by combinational logic networks with linear size and logarit
Externí odkaz:
http://arxiv.org/abs/1207.4497
A preferential arrangement of a set is a total ordering of the elements of that set with ties allowed. A barred preferential arrangement is one in which the tied blocks of elements are ordered not only amongst themselves but also with respect to one
Externí odkaz:
http://arxiv.org/abs/1206.6354
Autor:
Ahlbach, Connor, Swanson, Joshua P.
Publikováno v:
In European Journal of Combinatorics October 2018 73:37-60
Autor:
Ahlbach, Connor Thomas
Publikováno v:
HMC Senior Theses.
The Poincare-Miranda Theorem is a topological result about the existence of a zero of a function under particular boundary conditions. In this thesis, we explore proofs of the Poincare-Miranda Theorem that are discrete in nature - that is, they prove
Externí odkaz:
http://scholarship.claremont.edu/hmc_theses/47
http://scholarship.claremont.edu/cgi/viewcontent.cgi?article=1048&context=hmc_theses
http://scholarship.claremont.edu/cgi/viewcontent.cgi?article=1048&context=hmc_theses