Related papers: Block avoiding point sequencings of partial Steine…

A subset $S$ of a group $(G,+)$ is $t$-weakly sequenceable if there is an ordering $(y_1, \ldots, y_k)$ of its elements such that the partial sums~$s_0, s_1, \ldots, s_k$, given by $s_0 = 0$ and $s_i = \sum_{j=1}^i y_j$ for $1 \leq i \leq…

We consider the problem of summarizing a multi set of elements in $\{1, 2, \ldots , n\}$ under the constraint that no element appears more than $\ell$ times. The goal is then to answer \emph{rank} queries --- given $i\in\{1, 2, \ldots ,…

We give a stochastic optimization algorithm that solves a dense $n\times n$ real-valued linear system $Ax=b$, returning $\tilde x$ such that $\|A\tilde x-b\|\leq \epsilon\|b\|$ in time: $$\tilde O((n^2+nk^{\omega-1})\log1/\epsilon),$$ where…

We study a multispecies $t$-PushTASEP system on a finite ring of $n$ sites with site-dependent rates $x_1,\dots,x_n$. Let $\lambda=(\lambda_1,\dots,\lambda_n)$ be a partition whose parts represent the species of the $n$ particles on the…

We initiate an in-depth study of pattern avoidance on modified ascent sequences. Our main technique consists in using Stanley's standardization to obtain a transport theorem between primitive modified ascent sequences and permutations…

This paper continues our survey about the mean-field derivation of the two-dimensional signal-dependent Keller-Segel system studied in [1]. Therefore, we consider the same system of moderately interacting particles as before. The difference…

The standard way of solving a polynomial eigenvalue problem associated with a matrix polynomial starts by embedding the matrix coefficients of the polynomial into a matrix pencil, known as a strong linearization. This process transforms the…

The goal of partial-order methods is to accelerate the exploration of concurrent systems by examining only a representative subset of all possible runs. The stateful approach builds a transition system with representative runs, while the…

A subset $S$ of a group $(G,+)$ is $t$-weakly sequenceable if there is an ordering $(y_1, \ldots, y_k)$ of its elements such that the partial sums~$s_0, s_1, \ldots, s_k$, given by $s_0 = 0$ and $s_i = \sum_{j=1}^i y_j$ for $1 \leq i \leq…

Suppose $l,m$ are natural numbers with $l\le m$, and $\mathbb{F}$ a field of characteristic $p$, and let $\mathcal{C}_{l,m}^{\mathbb{F}}$ denote the centraliser of the group algebra $\mathbb{F}S_l$ inside $\mathbb{F}S_m$. Ellers and Murray…

Let $(P,\leq)$ be a finite poset (partially ordered set), where $P$ has cardinality $n$. Consider linear extensions of $P$ as permutations $x_1x_2\cdots x_n$ in one-line notation. For distinct elements $x,y\in P$, we define…

We prove that a 3-GDD of type $1^n k^1 \ell^1$, where $n= k \cdot \ell$, with minimum distance 3 exists for every $k$ and $\ell$ such that $n = k \ell$, $k = 1$ or $3~(mod ~ 6)$, and $\ell = 1$ or $3~(mod ~ 6)$. These designs are of the…

In 1996, Stanley extended the classical Catalan arrangement and semiorder arrangement, which are called the Catalan-type arrangement $\mathcal{C}_{n,A}$ and the semiorder-type arrangement $\mathcal{C}_{n,A}^*$ in this paper. By establishing…

A $3$-partition of an $n$-element set $V$ is a triple of pairwise disjoint nonempty subsets $X,Y,Z$ such that $V=X\cup Y\cup Z$. We determine the minimum size $\varphi_3(n)$ of a set $\mathcal{E}$ of triples such that for every 3-partition…

Partial-label learning is a kind of weakly-supervised learning with inexact labels, where for each training example, we are given a set of candidate labels instead of only one true label. Recently, various approaches on partial-label…

A quantum integrable system slightly perturbed away from integrability is typically expected to thermalize on timescales of order $\tau\sim \lambda^{-2}$, where $\lambda$ is the perturbation strength. We here study classes of perturbations…

The stochastic block model is a classical cluster-exhibiting random graph model that has been widely studied in statistics, physics and computer science. In its simplest form, the model is a random graph with two equal-sized clusters, with…

We give an elementary proof of a well-known result on Kostka numbers, following a question from Mark Wildon on MathOverflow. Namely, we show that given partitions $\lambda,\mu,\nu$ of $n$ with $\mu\trianglerighteq\nu$, we have…

We use algorithmic methods from online learning to explore some important objects at the intersection of model theory and combinatorics, and find natural ways that algorithmic methods can detect and explain (and improve our understanding…

We study classes of set partitions determined by the avoidance of multiple patterns, applying a natural notion of partition containment that has been introduced by Sagan. We say that two sets S and T of patterns are equivalent if for each…