Zobrazeno 1 - 10
of 22
pro vyhledávání: '"Tiefenbruck, Mark"'
Autor:
Chow, Timothy Y., Tiefenbruck, Mark G.
A Latin tableau of shape $\lambda$ and type $\mu$ is a Young diagram of shape $\lambda$ in which each box contains a single positive integer, with no repeated integers in any row or column, and the $i$th most common integer appearing $\mu_i$ times. O
Externí odkaz:
http://arxiv.org/abs/2408.04086
Suppose we wish to estimate $\#H$, the number of copies of some small graph $H$ in a large streaming graph $G$. There are many algorithms for this task when $H$ is a triangle, but just a few that apply to arbitrary $H$. Here we focus on one such algo
Externí odkaz:
http://arxiv.org/abs/2302.12210
We present methods for computing the distance from a Boolean polynomial on $m$ variables of degree $m-3$ (i.e., a member of the Reed-Muller code $RM(m-3,m)$) to the space of lower-degree polynomials ($RM(m-4,m)$). The methods give verifiable certific
Externí odkaz:
http://arxiv.org/abs/2106.13910
Autor:
Buhler, Joe, Freiling, Chris, Graham, Ron, Kariv, Jonathan, Roche, James R., Tiefenbruck, Mark, Van Alten, Clint, Yeroshkin, Dmytro
The Levine hat game requires $n$ players, each wearing an infinite random stack of black and white hats, to guess the location of a black hat on their own head seeing only the hats worn by all the other players. They are allowed a strategy session be
Externí odkaz:
http://arxiv.org/abs/1407.4711
Given a permutation $\sg = \sg_1 \ldots \sg_n$ in the symmetric group $S_n$, we say that $\sg_i$ matches the marked mesh pattern $MMP(a,b,c,d)$ in $\sg$ if there are at least $a$ points to the right of $\sg_i$ in $\sg$ which are greater than $\sg_i$,
Externí odkaz:
http://arxiv.org/abs/1303.0854
Publikováno v:
Pure Mathematics and Applications (Pu.M.A.) Vol. 23 (2012), No. 3, pp 219-256
This paper is a continuation of the systematic study of the distributions of quadrant marked mesh patterns initiated in [6]. Given a permutation $\sg = \sg_1 ... \sg_n$ in the symmetric group $S_n$, we say that $\sg_i$ matches the quadrant marked mes
Externí odkaz:
http://arxiv.org/abs/1201.6243
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
IEEE Transactions on Information Theory; Jan2022, Vol. 68 Issue 1, p560-571, 12p
Autor:
Buhler, Joe, Freiling, Chris, Graham, Ron, Kariv, Jonathan, Roche, James R., Tiefenbruck, Mark, Van Alten, Clint, Yeroshkin, Dmytro
Publikováno v:
Integers: Electronic Journal of Combinatorial Number Theory; 2021 Special Issue, Vol. 21A, p1-52, 52p
Autor:
Tiefenbruck, Mark
Publikováno v:
Tiefenbruck, Mark. (2012). Patterns and statistics on words. UC San Diego: Retrieved from: http://www.escholarship.org/uc/item/3cp1j3qb
We study the enumeration of combinatorial objects by number of occurrences of patterns and other statistics. This work is broken into three main parts. In the first part, we enumerate permutations, compositions, column- convex polyominoes, and words
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______325::ba7d88279775f2102f85bcd890f051a9
http://www.escholarship.org/uc/item/3cp1j3qb
http://www.escholarship.org/uc/item/3cp1j3qb