A Family of Partially Ordered Sets with Small Balance Constant

Given a finite poset $\mathcal P$ and two distinct elements $x$ and $y$, we let $\operatorname{pr}_{\mathcal P}(x \prec y)$ denote the fraction of linear extensions of $\mathcal P$ in which $x$ precedes $y$. The balance constant $\delta(\mathcal P)$ of $\mathcal P$ is then defined by $$\delta(\mathcal P) = \max_{x \neq y \in \mathcal P} \min \left\{ \operatorname{pr}_{\mathcal P}(x \prec y), \operatorname{pr}_{\mathcal P}(y \prec x) \right\}.$$ The $1/3$-$2/3$ conjecture asserts that $\delta(\mathcal P) \ge \frac13$ whenever $\mathcal P$ is not a chain, but except from certain trivial examples it is not known when equality occurs, or even if balance constants can approach $1/3$. In this paper we make some progress on the conjecture by exhibiting a sequence of posets with balance constants approaching $\frac{1}{32}(93-\sqrt{6697}) \approx 0.3488999$, answering a question of Brightwell. These provide smaller balance constants than any other known nontrivial family.Comment: 11 pages, 4 figure

Multiplicative and Exponential Variations of Orthomorphisms of Cyclic Groups

An orthomorphism is a permutation $\sigma$ of $\{1, \dots, n-1\}$ for which $x + \sigma(x) \mod n$ is also a permutation on $\{1, \dots, n-1\}$. Eberhard, Manners, Mrazovi\'c, showed that the number of such orthomorphisms is $(\sqrt{e} + o(1)) \cdot \frac{n!^2}{n^n}$ for odd $n$ and zero otherwise. In this paper we prove two analogs of these results where $x+\sigma(x)$ is replaced by $x \sigma(x)$ (a "multiplicative orthomorphism") or with $x^{\sigma(x)}$ (an "exponential orthomorphism"). Namely, we show that no multiplicative orthomorphisms exist for $n > 2$ but that exponential orthomorphisms exist whenever $n$ is twice a prime $p$ such that $p-1$ is squarefree. In the latter case we then estimate the number of exponential orthomorphisms.Comment: 11 pages, 1 figur

Elliptic Curve Variants of the Least Quadratic Nonresidue Problem and Linnik's Theorem

Let $E_1$ and $E_2$ be $\overline{\mathbb{Q}}$-nonisogenous, semistable elliptic curves over $\mathbb{Q}$, having respective conductors $N_{E_1}$ and $N_{E_2}$ and both without complex multiplication. For each prime $p$, denote by $a_{E_i}(p) := p+1-\#E_i(\mathbb{F}_p)$ the trace of Frobenius. Under the assumption of the Generalized Riemann Hypothesis (GRH) for the convolved symmetric power $L$-functions $L(s, \mathrm{Sym}^i E_1\otimes\mathrm{Sym}^j E_2)$ where $i,j\in\{0,1,2\}$, we prove an explicit result that can be stated succinctly as follows: there exists a prime $p\nmid N_{E_1}N_{E_2}$ such that $a_{E_1}(p)a_{E_2}(p)<0$ and $$p < \big( (32+o(1))\cdot \log N_{E_1} N_{E_2}\big)^2.$$ This improves and makes explicit a result of Bucur and Kedlaya. Now, if $I\subset[-1,1]$ is a subinterval with Sato-Tate measure $\mu$ and if the symmetric power $L$-functions $L(s, \mathrm{Sym}^k E_1)$ are functorial and satisfy GRH for all $k \le 8/\mu$, we employ similar techniques to prove an explicit result that can be stated succinctly as follows: there exists a prime $p\nmid N_{E_1}$ such that $a_{E_1}(p)/(2\sqrt{p})\in I$ and $$p < \left((21+o(1)) \cdot \mu^{-2}\log (N_{E_1}/\mu)\right)^2.$$Comment: 30 page

On Logarithmically Benford Sequences

Let $\mathcal{I} \subset \mathbb{N}$ be an infinite subset, and let $\{a_i\}_{i \in \mathcal{I}}$ be a sequence of nonzero real numbers indexed by $\mathcal{I}$ such that there exist positive constants $m, C_1$ for which $|a_i| \leq C_1 \cdot i^m$ for all $i \in \mathcal{I}$. Furthermore, let $c_i \in [-1,1]$ be defined by $c_i = \frac{a_i}{C_1 \cdot i^m}$ for each $i \in \mathcal{I}$, and suppose the $c_i$'s are equidistributed in $[-1,1]$ with respect to a continuous, symmetric probability measure $\mu$. In this paper, we show that if $\mathcal{I} \subset \mathbb{N}$ is not too sparse, then the sequence $\{a_i\}_{i \in \mathcal{I}}$ fails to obey Benford's Law with respect to arithmetic density in any sufficiently large base, and in fact in any base when $\mu([0,t])$ is a strictly convex function of $t \in (0,1)$. Nonetheless, we also provide conditions on the density of $\mathcal{I} \subset \mathbb{N}$ under which the sequence $\{a_i\}_{i \in \mathcal{I}}$ satisfies Benford's Law with respect to logarithmic density in every base. As an application, we apply our general result to study Benford's Law-type behavior in the leading digits of Frobenius traces of newforms of positive, even weight. Our methods of proof build on the work of Jameson, Thorner, and Ye, who studied the particular case of newforms without complex multiplication.Comment: 10 page

Linnik's Theorem for Sato-Tate Laws on Elliptic Curves with Complex Multiplication

Let $E/\mathbb{Q}$ be an elliptic curve with complex multiplication (CM), and for each prime $p$ of good reduction, let $a_E(p) = p + 1 - \#E(\mathbb{F}_p)$ denote the trace of Frobenius. By the Hasse bound, $a_E(p) = 2\sqrt{p} \cos \theta_p$ for a unique $\theta_p \in [0, \pi]$. In this paper, we prove that the least prime $p$ such that $\theta_p \in [\alpha, \beta] \subset [0, \pi]$ satisfies $$p \ll \left(\frac{N_E}{\beta - \alpha}\right)^A,$$ where $N_E$ is the conductor of $E$ and the implied constant and exponent $A > 2$ are absolute and effectively computable. Our result is an analogue for CM elliptic curves of Linnik's Theorem for arithmetic progressions, which states that the least prime $p \equiv a \pmod q$ for $(a,q)=1$ satisfies $p \ll q^L$ for an absolute constant $L > 0$.Comment: 11 pages; made minor modification

Video TFRC

TCP-friendly rate control (TFRC) is a congestion control technique that trade-offs responsiveness to the network conditions for a smoother throughput variation. We take advantage of this trade-off by calculating the rate gap between the theoretical TCP throughput and the smoothed TFRC throughput. Any rate gain from this rate gap is then opportunistically used for video coding. We define a frame complexity measure to determine the additional rate to be used from the rate gap and then perform a rate negotiation to determine the target rate for the encoder and the final sending rate. Results show that although this method has a more aggressive sending rate compared to TFRC, it is still TCP friendly, does not contribute too much to network congestion and achieves a reasonable video quality gain over the conventional method

Interpretation of Angular Distributions of ZZ-boson Production at Colliders

High precision data of dilepton angular distributions in $\gamma^*/Z$ production were reported recently by the CMS Collaboration covering a broad range of the dilepton transverse momentum, $q_T$, up to $\sim 300$ GeV. Pronounced $q_T$ dependencies of the $\lambda$ and $\nu$ parameters, characterizing the $\cos^2\theta$ and $\cos 2\phi$ angular distributions, were found. Violation of the Lam-Tung relation was also clearly observed. We show that the $q_T$ dependence of $\lambda$ allows a determination of the relative contributions of the $q \bar q$ annihilation versus the $qG$ Compton process. The violation of the Lam-Tung relation is attributed to the presence of a non-zero component of the $q - \bar q$ axis in the direction normal to the "hadron plane" formed by the colliding hadrons. The magnitude of the violation of the Lam-Tung relation is shown to reflect the amount of this `non-coplanarity". The observed $q_T$ dependencies of $\lambda$ and $\nu$ from the CMS and the earlier CDF data can be well described using this approach.Comment: 5 pages, 3 figure

On the Rotational Invariance and Non-Invariance of Lepton Angular Distributions in Drell-Yan and Quarkonium Production

Several rotational invariant quantities for the lepton angular distributions in Drell-Yan and quarkonium production were derived several years ago, allowing the comparison between different experiments adopting different reference frames. Using an intuitive picture for describing the lepton angular distribution in these processes, we show how the rotational invariance of these quantities can be readily obtained. This approach can also be used to determine the rotational invariance or non-invariance of various quantities specifying the amount of violation for the Lam-Tung relation. While the violation of the Lam-Tung relation is often expressed by frame-dependent quantities, we note that alternative frame-independent quantities are preferred.Comment: 4 pages, 1 figure, revised version, to appear in Phys. Lett

Optimal use of Charge Information for the HL-LHC Pixel Detector Readout

The pixel detectors for the High Luminosity upgrades of the ATLAS and CMS detectors will preserve digitized charge information in spite of extremely high hit rates. Both circuit physical size and output bandwidth will limit the number of bits to which charge can be digitized and stored. We therefore study the effect of the number of bits used for digitization and storage on single and multi-particle cluster resolution, efficiency, classification, and particle identification. We show how performance degrades as fewer bits are used to digitize and to store charge. We find that with limited charge information (4 bits), one can achieve near optimal performance on a variety of tasks.Comment: 27 pages, 20 figure