Related papers: Hook Length Biases in $t$-Core Partitions

In large networks, using the length of shortest paths as the distance measure has shortcomings. A well-studied shortcoming is that extending it to disconnected graphs and directed graphs is controversial. The second shortcoming is that a…

Following the breakthrough of Croot, Lev, and Pach, Tao introduced a symmetrized version of their argument, which is now known as the slice rank method. In this paper, we introduce a more general version of the slice rank of a tensor, which…

We consider uniformly random set partitions of size $n$ with exactly $k$ blocks, and uniformly random permutations of size $n$ with exactly $k$ cycles, under the regime where $n-k \sim t\sqrt{n}$, $t>0$. In this regime, there is a simple…

The area of research called \textquotedblleft Lineability\textquotedblright% \ looks for linear structures inside exotic subsets of vector spaces. In the last decade lineability/spaceability has been investigated in rather general settings;…

We prove that any finite collection of polygons of equal area has a common hinged dissection. That is, for any such collection of polygons there exists a chain of polygons hinged at vertices that can be folded in the plane continuously…

In this paper, we further develop the theory of circles of partition by introducing the notion of complex circles of partition. This work generalizes the classical framework, extending from subsets of the natural numbers as base sets to…

Using transfer matrices up to next-nearest-neighbour (NNN) interactions, we examine the structural correlations of quasi-one-dimensional systems of hard disks confined by two parallel lines and hard spheres confined in cylinders.…

It is known when we call a poset P, a $\mathcal{P}$-chain permutational poset, given a subset of permutations $\mathcal{P}$ of the symmetric group $S_{n}$. In this work, we use the same idea to study subsets of words of length $n$, that are…

A major research area in discrete geometry is to consider the best way to partition the $d$-dimensional Euclidean space $\mathbb{R}^d$ under various quality criteria. In this paper we introduce a new type of space partitioning that is…

Torsion and Betti numbers for knots are special cases of more general invariants associated to a finitely generated group G and epimorphism from G to the integers. The sequence of Betti numbers is always periodic; under mild hypotheses, the…

This work provides a unified formalism for studying difference and (Hasse-) differential algebraic geometry, by introducing a theory of "iterative Hasse rings and schemes". As an application, Hasse jet spaces are constructed generally,…

The purpose of this letter is to improve Hoeffding's lemma and consequently Hoeffding's tail bounds. The improvement pertains to left skewed zero mean random variables $X\in[a,b]$, where $a<0$ and $-a>b$. The proof of Hoeffding's improved…

While analyzing the persistence length of DNA atomistic simulations Wu et al. [J. Chem. Phys. 142, 125103 (2015)] introduced an empirical formula to account for the observed length-dependence. In particular they found that the persistence…

The goal of this paper is to address A. Shumakovitch's conjecture about the existence of $\Z_2$-torsion in Khovanov link homology. We analyze torsion in Khovanov homology of semi-adequate links via chromatic cohomology for graphs which…

Upper bounds on the maximum number of codewords in a binary code of a given length and minimum Hamming distance are considered. New bounds are derived by a combination of linear programming and counting arguments. Some of these bounds…

In this Ph.D dissertation (University of Virginia, 2022), we prove results about the coefficients of partition-theoretic generating functions and of coefficients of integer weight modular forms. Using various forms of the circle method, we…

This is an expository note answering a question posed to us by Richard Stanley, in which we prove a limit shape theorem for partitions of $n$ which maximize the number of subpartitions. The limit shape and the growth rate of the number of…

Recently, Andrews, Chan, Kim and Osburn introduced the even strings and the odd strings in the overpartitions. We show that their conjecture $A_k (n) \geq B_k (n)$ holds for large enough positive integers n, where A_k(n) (resp. B_k(n)) is…

The Cartesian tree of a sequence captures the relative order of the sequence's elements. In recent years, Cartesian tree matching has attracted considerable attention, particularly due to its applications in time series analysis. Consider a…

This talk consists of two parts. In the first, the present experimental bounds on the anomalous couplings of the gauge bosons, based mainly on the LEP and Tevatron experiments, are reviewed. In the second part, the theorem of helicity…