Related papers: Computing the Size of Intervals in the Weak Bruhat…
We investigate new graph classes of bounded mim-width, strictly extending interval graphs and permutation graphs. The graphs $K_t \boxminus K_t$ and $K_t \boxminus S_t$ are graphs obtained from the disjoint union of two cliques of size $t$,…
Consider an incoming sequence of vectors, all belonging to an unknown subspace $\operatorname{S}$, and each with many missing entries. In order to estimate $\operatorname{S}$, it is common to partition the data into blocks and iteratively…
In this article we investigate model order reduction of large-scale systems using time-limited balanced truncation, which restricts the well known balanced truncation framework to prescribed finite time intervals. The main emphasis is on…
We determine the scaling limit for permutations conditioned to have longest decreasing subsequence of length at most $d$. These permutations are also said to avoid the pattern $(d+1)d \cdots 2 1$ and they can be written as a union of $d$…
Let $S_n^\lambda$ be the set of all permutations over the multiset $\{\overbrace{1,...,1}^{\lambda},...,\overbrace{m,...,m}^\lambda\}$ where $n=m\lambda$. A frequency permutation array (FPA) of minimum distance $d$ is a subset of…
In this paper, we study the variance of the number of squarefull numbers in short intervals. As a result, we are able to prove that, for any $0 < \theta < 1/2$, almost all short intervals $(x, x + x^{1/2 + \theta}]$ contain about…
We consider a class of stochastic gradient optimization schemes. Assuming that the objective function is strongly convex, we prove weak error estimates which are uniform in time for the error between the solution of the numerical scheme,…
Complex interval arithmetic is a powerful tool for the analysis of computational errors. The naturally arising rectangular, polar, and circular (together called primitive) interval types are not closed under simple arithmetic operations,…
The order $O_n(\sigma)$ of a permutation $\sigma$ of $n$ objects is the smallest integer $k \geq 1$ such that the $k$-th iterate of $\sigma$ gives the identity. A remarkable result about the order of a uniformly chosen permutation is due to…
A walk $u_0u_1 \ldots u_{k-1}u_k$ of a graph $G$ is a \textit{weakly toll walk} if $u_0u_k \not\in E(G)$, $u_0u_i \in E(G)$ implies $u_i = u_1$, and $u_ju_k\in E(G)$ implies $u_j=u_{k-1}$. The {\em weakly toll interval} of a set $S…
Many problems in machine learning write as the minimization of a sum of individual loss functions over the training examples. These functions are usually differentiable but, in some cases, their gradients are not Lipschitz continuous, which…
The higher Bruhat order is a poset of cubical tilings of a cyclic zonotope whose covering relations are cubical flips. For a 2-dimensional zonotope, the higher Bruhat order is isomorphic to a poset on commutation classes of reduced words…
Interval temporal logics provide a general framework for temporal reasoning about interval structures over linearly ordered domains, where intervals are taken as the primitive ontological entities. In this paper, we identify all fragments…
The Unbounded Subset-Sum Problem (USSP) is defined as: given sum $s$ and a set of integers $W\leftarrow \{p_1,\dots,p_n\}$ output a set of non-negative integers $\{y_1,\dots,y_n\}$ such that $p_1y_1+\dots+p_ny_n=s$. The USSP is an…
In this note we investigate correlation inequalities for `up-sets' of permutations, in the spirit of the Harris--Kleitman inequality. We focus on two well-studied partial orders on $S_n$, giving rise to differing notions of up-sets. Our…
Let $PW_S^1$ be the space of integrable functions on $\mathbb{R}$ whose Fourier transform vanishes outside $S$, where $S = [-\sigma,-\rho]\cup[\rho,\sigma]$, $0<\rho<\sigma$. In the case $\rho>\sigma/2$, we present a complete description of…
The partition problem is a well-known basic NP-complete problem. We mainly consider the optimization version of it in this paper. The problem has been investigated from various perspectives for a long time and can be solved efficiently in…
Quantum Bruhat graph is a weighted directed graph on a finite Weyl group first defined by Brenti-Fomin-Postnikov. It encodes quantum Monk's rule and can be utilized to study the $3$-point Gromov-Witten invariants of the flag variety. In…
We discuss some issues arising in the evaluation of confidence intervals in the presence of nuisance parameters (systematic uncertainties) by means of direct Neyman construction in multi-dimensional space. While this kind of procedure…
Submodular width is a central structural measure governing the complexity of conjunctive query evaluation. In this paper we recast submodular width in geometric terms. We how that submodular width can be approximated, up to a factor $3/2$,…