Zobrazeno 1 - 10
of 148
pro vyhledávání: '"Linusson, Svante"'
Autor:
Lazar, Alexander, Linusson, Svante
Set-valued standard Young tableaux are a generalization of standard Young tableaux due to Buch (2002) with applications in algebraic geometry. The enumeration of set-valued SYT is significantly more complicated than in the ordinary case, although pro
Externí odkaz:
http://arxiv.org/abs/2410.04860
Autor:
Linusson, Svante, Verkama, Emil
We enumerate the numbers $Av_n^k(1324)$ of 1324-avoiding $n$-permutations with exactly $k$ inversions for all $k$ and $n \geq (k+7)/2$. The result depends on a structural characterization of such permutations in terms of a new notion of almost-decomp
Externí odkaz:
http://arxiv.org/abs/2408.15075
Autor:
Linusson, Svante, Restadh, Petter
The purpose of this paper is twofold. We investigate a simple necessary condition, called the rhombus criterion, for two vertices in a polytope not to form an edge and show that in many examples of $0/1$-polytopes it is also sufficient. We explain ho
Externí odkaz:
http://arxiv.org/abs/2305.05275
The edges of the characteristic imset polytope, $\operatorname{CIM}_p$, were recently shown to have strong connections to causal discovery as many algorithms could be interpreted as greedy restricted edge-walks, even though only a strict subset of th
Externí odkaz:
http://arxiv.org/abs/2209.07579
Publikováno v:
European Journal of Combinatorics, 113, 2023
Barely set-valued tableaux are a variant of Young tableaux in which one box contains two numbers as its entry. It has recently been discovered that there are product formulas enumerating certain classes of barely set-valued tableaux. We give some $q$
Externí odkaz:
http://arxiv.org/abs/2106.07418
Finding a directed acyclic graph (DAG) that best encodes the conditional independence statements observable from data is a central question within causality. Algorithms that greedily transform one candidate DAG into another given a fixed set of moves
Externí odkaz:
http://arxiv.org/abs/2103.03771
Publikováno v:
Combinatorial Theory, 1, (2021)
We prove several new instances of the cyclic sieving phenomenon (CSP) on Catalan objects of type A and type B. Moreover, we refine many of the known instances of the CSP on Catalan objects. For example, we consider triangulations refined by the numbe
Externí odkaz:
http://arxiv.org/abs/2010.11157
Publikováno v:
Ark. Mat., 59 (2021), 247-274
We examine a few families of semistandard Young tableaux, for which we observe the cyclic sieving phenomenon under promotion. The first family we consider consists of stretched hook shapes, where we use the cocharge generating polynomial as CSP-polyn
Externí odkaz:
http://arxiv.org/abs/2007.10478
Let $W$ be a finite Weyl group and $\widetilde W$ the corresponding affine Weyl group. A random element of $\widetilde W$ can be obtained as a reduced random walk on the alcoves of $\widetilde W$. By a theorem of Lam (Ann. Prob. 2015), such a walk al
Externí odkaz:
http://arxiv.org/abs/2004.13399
Publikováno v:
In European Journal of Combinatorics October 2023 113
