Related papers: Restricted inversion sequences and enhanced $3$-no…

Interpreting three-leaf binary trees or {\em rooted triples} as constraints yields an entailment relation, whereby binary trees satisfying some rooted triples must also thus satisfy others, and thence a closure operator, which is known to…

For any $n\geq 3$, we prove that there exist equivalences between these apparently unrelated objects: irreducible $n$-dimensional non degenerate projective varieties $X\subset \mathbb P^{2n+1}$ different from rational normal scrolls and…

A partition of $n$ is called a $t$-core partition if none of its hook number is divisible by $t.$ In 2019, Hirschhorn and Sellers \cite{Hirs2019} obtained a parity result for $3$-core partition function $a_3(n)$. Motivated by this result,…

We prove under the Bombieri-Lang conjecture for surfaces that there is an absolute bound on the length of sequences of integer squares with constant second differences, for sequences which are not formed by the squares of integers in…

Confidence sequences, anytime p-values (called p-processes in this paper), and e-processes all enable sequential inference for composite and nonparametric classes of distributions at arbitrary stopping times. Examining the literature, one…

We define refined invariants which "count" nodal curves in sufficiently ample linear systems on surfaces, conjecture that their generating function is multiplicative, and conjecture explicit formulas in the case of K3 and abelian surfaces.…

In this paper; we prove that all sequences can be broken up in cycles. Each cycle follows the same pattern: 1) Upward trajectory. Odd and even numbers alternate until the cycle reaches an upper bound 2) Downward trajectory. Two or more…

Noting a curious link between Andrews' even-odd crank and the Stanley rank, we adopt a combinatorial approach building on the map of conjugation and continue the study of integer partitions with parts separated by parity. Our motivation is…

The cardinal invariants $ \mathfrak h, \mathfrak b, \mathfrak s$ of $\mathcal P (\omega)$ are known to satisfy that $\omega_1 \leq \mathfrak h \leq\min\{\mathfrak b, \mathfrak s\}$. We prove that all inequalities can be strict. We also…

Let $D$ be a digraph. We call a subset $N$ of $V(D)$ $k$-independent if for every pair of vertices $u,v \in N$, $d(u,v) \geq k$; and we call it $\ell$-absorbent if for every vertex $u \in V(D) \setminus N$, there exists $v \in N$ such that…

We construct generating trees with one, two, and three labels for some classes of permutations avoiding generalized patterns of length 3 and 4. These trees are built by adding at each level an entry to the right end of the permutation,…

Approximate Bayesian computation has emerged as a standard computational tool when dealing with the increasingly common scenario of completely intractable likelihood functions in Bayesian inference. We show that many common Markov chain…

To any affine scheme with a $\mathbb{G}_m$-action, we provide a Bousfield colocalization on the equivariant derived category of modules by constructing, via homotopical methods, an idempotent integral kernel. This endows the equivariant…

It is well known that in string compactifications on toric Calabi-Yau manifolds one can introduce refined BPS invariants that carry information not only about the charge of the BPS state but also about the spin content. In this paper we…

Motivated by a construction in the theory of cluster algebras (Fomin and Zelevinsky), one associates to each acyclic directed graph a family of sequences of natural integers, one for each vertex; this construction is called a {\em frieze};…

Inversion sequences of length $n$, $\mathbf{I}_n$, are integer sequences $(e_1, \ldots, e_n)$ with $0 \leq e_i < n$ for each $i$. The study of patterns in inversion sequences was initiated recently by Mansour-Shattuck and…

We show that two classes of combinatorial objects--inversion tables with no subsequence of decreasing consecutive numbers and matchings with no 2-nestings--are enumerated by the Fishburn numbers. In particular, we give a simple bijection…

Vasiu proved that the level torsion $\ell_{\mathcal{M}}$ of an $F$-crystal $\mathcal{M}$ over an algebraically closed field of characteristic $p>0$ is a non-negative integer that is an effectively computable upper bound of the isomorphism…

Menon's proof of the preservation of log-concavity of sequences under convolution becomes simpler when adapted to 2-sided infinite sequences. Under assumption of log-concavity of two 2-sided infinite sequences, the existence of the…

The Fibonacci numbers are the prototypical example of a recursive sequence, but grow too quickly to enumerate sets of integer partitions. The same is true for the other classical sequences $a(n)$ defined by Fibonacci-like recursions: the…