skip to main content

Attention:

The NSF Public Access Repository (PAR) system and access will be unavailable from 8:00 PM ET on Friday, March 21 until 8:00 AM ET on Saturday, March 22 due to maintenance. We apologize for the inconvenience.


Search for: All records

Creators/Authors contains: "Griffin, Michael"

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. Abstract

    To counteract the contribution of CO2emissions by cement production and utilization, biochar is being harnessed as a carbon-negative additive in concrete. Increasing the cement replacement and biochar dosage will increase the carbon offset, but there is large variability in methods being used and many researchers report strength decreases at cement replacements beyond 5%. This work presents a reliable method to replace 10% of the cement mass with a vast selection of biochars without decreasing ultimate compressive strength, and in many cases significantly improving it. By carefully quantifying the physical and chemical properties of each biochar used, machine learning algorithms were used to elucidate the three most influential biochar characteristics that control mortar strength: initial saturation percentage, oxygen-to-carbon ratio, and soluble silicon. These results provide additional research avenues for utilizing several potential biomass waste streams to increase the biochar dosage in cement mixes without decreasing mechanical properties.

    Graphical Abstract

     
    more » « less
  2. Motivated by the many roles that hook lengths play in mathematics, we study the distribution of the number oftt-hooks in the partitions ofnn. We prove that the limiting distribution is normal with mean\[μ<#comment/>t(n)∼<#comment/>6nπ<#comment/>−<#comment/>t2\mu _t(n)\sim \frac {\sqrt {6n}}{\pi }-\frac {t}{2}\]and variance\[σ<#comment/>t2(n)∼<#comment/>(π<#comment/>2−<#comment/>6)6n2π<#comment/>3.\sigma _t^2(n)\sim \frac {(\pi ^2-6)\sqrt {6n}}{2\pi ^3}.\]Furthermore, we prove that the distribution of the number of hook lengths that are multiples of a fixedt≥<#comment/>4t\geq 4in partitions ofnnconverge to a shifted Gamma distribution with parameterk=(t−<#comment/>1)/2k=(t-1)/2and scaleθ<#comment/>=2/(t−<#comment/>1)\theta =\sqrt {2/(t-1)}.

     
    more » « less
  3. Abstract

    Ramanujan’s partition congruences modulo$$\ell \in \{5, 7, 11\}$${5,7,11}assert that$$\begin{aligned} p(\ell n+\delta _{\ell })\equiv 0\pmod {\ell }, \end{aligned}$$p(n+δ)0(mod),where$$0<\delta _{\ell }<\ell $$0<δ<satisfies$$24\delta _{\ell }\equiv 1\pmod {\ell }.$$24δ1(mod).By proving Subbarao’s conjecture, Radu showed that there are no such congruences when it comes to parity. There are infinitely many odd (resp. even) partition numbers in every arithmetic progression. For primes$$\ell \ge 5,$$5,we give a new proof of the conclusion that there are infinitely manymfor which$$p(\ell m+\delta _{\ell })$$p(m+δ)is odd. This proof uses a generalization, due to the second author and Ramsey, of a result of Mazur in his classic paper on the Eisenstein ideal. We also refine a classical criterion of Sturm for modular form congruences, which allows us to show that the smallest suchmsatisfies$$m<(\ell ^2-1)/24,$$m<(2-1)/24,representing a significant improvement to the previous bound.

     
    more » « less
  4. Abstract Hausel and Rodriguez-Villegas (2015, Astérisque 370, 113–156) recently observed that work of Göttsche, combined with a classical result of Erdös and Lehner on integer partitions, implies that the limiting Betti distribution for the Hilbert schemes $(\mathbb {C}^{2})^{[n]}$ on $n$ points, as $n\rightarrow +\infty ,$ is a Gumbel distribution . In view of this example, they ask for further such Betti distributions. We answer this question for the quasihomogeneous Hilbert schemes $((\mathbb {C}^{2})^{[n]})^{T_{\alpha ,\beta }}$ that are cut out by torus actions. We prove that their limiting distributions are also of Gumbel type. To obtain this result, we combine work of Buryak, Feigin, and Nakajima on these Hilbert schemes with our generalization of the result of Erdös and Lehner, which gives the distribution of the number of parts in partitions that are multiples of a fixed integer $A\geq 2.$ Furthermore, if $p_{k}(A;n)$ denotes the number of partitions of $n$ with exactly $k$ parts that are multiples of $A$ , then we obtain the asymptotic $$ \begin{align*} p_{k}(A,n)\sim \frac{24^{\frac k2-\frac14}(n-Ak)^{\frac k2-\frac34}}{\sqrt2\left(1-\frac1A\right)^{\frac k2-\frac14}k!A^{k+\frac12}(2\pi)^{k}}e^{2\pi\sqrt{\frac1{6}\left(1-\frac1A\right)(n-Ak)}}, \end{align*} $$ a result which is of independent interest. 
    more » « less
  5. Abstract

    We explicitly construct the Dirichlet series $$\begin{equation*}L_{\mathrm{Tam}}(s):=\sum_{m=1}^{\infty}\frac{P_{\mathrm{Tam}}(m)}{m^s},\end{equation*}$$ where $P_{\mathrm{Tam}}(m)$ is the proportion of elliptic curves $E/\mathbb{Q}$ in short Weierstrass form with Tamagawa product m. Although there are no $E/\mathbb{Q}$ with everywhere good reduction, we prove that the proportion with trivial Tamagawa product is $P_{\mathrm{Tam}}(1)={0.5053\dots}$. As a corollary, we find that $L_{\mathrm{Tam}}(-1)={1.8193\dots}$ is the average Tamagawa product for elliptic curves over $\mathbb{Q}$. We give an application of these results to canonical and Weil heights.

     
    more » « less