The following pages link to Daniel M. Kane (Q289683):
Displaying 50 items.
- Closed expressions for averages of set partition statistics (Q289685) (← links)
- (Q347456) (redirect page) (← links)
- The average sensitivity of an intersection of half spaces (Q347457) (← links)
- On the ranks of the 2-Selmer groups of twists of a given elliptic curve (Q380362) (← links)
- The correct exponent for the Gotsman-Linial conjecture (Q488047) (← links)
- Central limit theorems for some set partition statistics (Q494131) (← links)
- The Gaussian surface area and noise sensitivity of degree-\(d\) polynomial threshold functions (Q645127) (← links)
- Minimal models of compact symplectic semitoric manifolds (Q681810) (← links)
- A short implicant of a CNF formula with many satisfying assignments (Q727982) (← links)
- An elementary derivation of the asymptotics of partition functions (Q850515) (← links)
- Asymptotics of McKay numbers for \(S_n\) (Q877933) (← links)
- Modeling the distribution of ranks, Selmer groups, and Shafarevich-Tate groups of elliptic curves (Q887293) (← links)
- On the \(\mathcal S_{n}\)-modules generated by partitions of a given shape (Q1010843) (← links)
- Dynamic ham-sandwich cuts in the plane (Q1025301) (← links)
- Classifying toric and semitoric fans by lifting equations from \(\mathrm{SL}_2(\mathbb{Z})\) (Q1743726) (← links)
- A structure theorem for poorly anticoncentrated polynomials of Gaussians and applications to the study of polynomial threshold functions (Q2012247) (← links)
- Prisoners, rooms, and light switches (Q2227823) (← links)
- Waring's theorem for binary powers (Q2300161) (← links)
- On the number of ABC solutions with restricted radical sizes (Q2343170) (← links)
- An example concerning set addition in \(\mathbb{F}_2^n\) (Q2423213) (← links)
- Minimal \(\mathcal S\)-universality criteria may vary in size (Q2448538) (← links)
- On lower bounds on the size of sums-of-squares formulas (Q2474304) (← links)
- Generalized base representations (Q2506375) (← links)
- A bound on partitioning clusters (Q2628261) (← links)
- Canonical Projective Embeddings of the Deligne–Lusztig Curves Associated to<sup>2</sup><i>A</i><sub>2</sub>,<sup>2</sup><i>B</i><sub>2</sub>, and<sup>2</sup><i>G</i><sub>2</sub> (Q2797855) (← links)
- Best Possible Densities of Dickson m-Tuples, as a Consequence of Zhang–Maynard–Tao (Q2800633) (← links)
- Big-Key Symmetric Encryption: Resisting Key Exfiltration (Q2835594) (← links)
- Asymptotic Improvements of Lower Bounds for the Least Common Multiples of Arithmetic Progressions (Q2925373) (← links)
- A Short Implicant of a CNF Formula with Many Satisfying Assignments (Q2942635) (← links)
- Dropping Lowest Grades (Q3018980) (← links)
- On Solving Games Constructed Using Both Short and Long Conjunctive Sums (Q3068172) (← links)
- Almost Optimal Explicit Johnson-Lindenstrauss Families (Q3088132) (← links)
- (Q3103471) (← links)
- Counting Arbitrary Subgraphs in Data Streams (Q3167047) (← links)
- Tight Bounds for Testing k-Linearity (Q3167415) (← links)
- (Q3171628) (← links)
- A Pseudopolynomial Algorithm for Alexandrov’s Theorem (Q3183474) (← links)
- Sparser Johnson-Lindenstrauss Transforms (Q3189639) (← links)
- (Q3191587) (← links)
- Weak mixing of a transformation similar to Pascal (Q3426753) (← links)
- New results on the least common multiple of consecutive integers (Q3629412) (← links)
- Pseudorandomness via the Discrete Fourier Transform (Q4562280) (← links)
- (Q4601847) (← links)
- Robustly Learning a Gaussian: Getting Optimal Error, Efficiently (Q4608066) (← links)
- (Q4633860) (← links)
- Robust Estimators in High-Dimensions Without the Computational Intractability (Q4634036) (← links)
- Resolution of a conjecture of Andrews and Lewis involving cranks of partitions (Q4813634) (← links)
- (Q4831478) (← links)
- AN ASYMPTOTIC FOR THE NUMBER OF SOLUTIONS TO LINEAR EQUATIONS IN PRIME NUMBERS FROM SPECIFIED CHEBOTAREV CLASSES (Q4923265) (← links)
- A polynomial restriction lemma with applications (Q4978008) (← links)
