Zobrazeno 1 - 10
of 55
pro vyhledávání: '"Zaleski, Anthony"'
Autor:
Zaleski, Anthony, Zeilberger, Doron
Bob Hough recently disproved a long-standing conjecture of Paul Erd\H{o}s regarding covering systems. Inspired by his seminal paper, we describe analogs of covering systems to Boolean functions, and more generally, the problem of covering discrete hy
Externí odkaz:
http://arxiv.org/abs/1801.05097
Autor:
Zaleski, Anthony, Zeilberger, Doron
Tewodros Amdeberhan and Armin Straub initiated the study of enumerating subfamilies of the set of (s,t)-core partitions. While the enumeration of (n+1,n+2)-core partitions into distinct parts is relatively easy (in fact it equals the Fibonacci number
Externí odkaz:
http://arxiv.org/abs/1712.10072
Autor:
Zaleski, Anthony
Using Maple, we implement a SAT solver based on the principle of inclusion-exclusion and the Bonferroni inequalities. Using randomly generated input, we investigate the performance of our solver as a function of the number of variables and number of
Externí odkaz:
http://arxiv.org/abs/1712.06587
Autor:
Zaleski, Anthony
Feller's book An Introduction to Probability Theory and Its Application discusses statistics corresponding to sequences of coin tosses, with a dollar being won or lost depending on the outcome of each toss. This is equivalent to analyzing walks in th
Externí odkaz:
http://arxiv.org/abs/1712.01688
Autor:
Biers-Ariel, Yonah, Chakraborty, Haripriya, Chiarelli, John, Ek, Bryan, Lohr, Andrew, Park, Jinyoung, Semonsen, Justin, Voepel, Richard, Yang, Mingjia, Zaleski, Anthony, Zeilberger, Doron
This paper presents a collection of experimental results regarding permutation pattern avoidance, focusing on cases where there are "many" patterns to be avoided.
Comment: 9 pages. Accompanied by several Maple programs, and input and output file
Comment: 9 pages. Accompanied by several Maple programs, and input and output file
Externí odkaz:
http://arxiv.org/abs/1703.02415
Autor:
Zaleski, Anthony
In a previous paper (arXiv:1608.02262), we used computer-assisted methods to find explicit expressions for the moments of the size of a uniform random (n,n+1)-core partition with distinct parts. In particular, we conjectured that the distribution is
Externí odkaz:
http://arxiv.org/abs/1702.05634
Autor:
ZALESKI, ANTHONY, ZEILBERGER, DORON
Publikováno v:
Mathematics Magazine, 2020 Feb 01. 93(1), 54-61.
Externí odkaz:
https://www.jstor.org/stable/48665691
Autor:
Zaleski, Anthony, Zeilberger, Doron
Inspired by Armin Straub's conjecture (arXiv:1601.07161) about the number and maximal size of (2n+1, 2n+3)-core partitions with distinct parts, we develop relatively efficient, symbolic-computational algorithms, based on non-linear functional recurre
Externí odkaz:
http://arxiv.org/abs/1611.05775
Autor:
Zaleski, Anthony
Publikováno v:
Adv. Appl. Math. 84, 1-7 (2017)
For fixed s, the size of an (s, s+1)-core partition with distinct parts can be seen as a random variable X_s. Using computer-assisted methods, we derive formulas for the expectation, variance, and higher moments of X_s. Our results give good evidence
Externí odkaz:
http://arxiv.org/abs/1608.02262
Autor:
Muratov, Cyrill B., Zaleski, Anthony
Publikováno v:
Ann. Global Anal. Geom. 47, 63-80 (2014)
This paper provides a quantitative version of the recent result of Kn\"upfer and Muratov ({\it Commun. Pure Appl. Math.} {\bf 66} (2013), 1129--1162) concerning the solutions of an extension of the classical isoperimetric problem in which a non-local
Externí odkaz:
http://arxiv.org/abs/1403.7808