English
Related papers

Related papers: Constraining Strong c-Wilf Equivalence Using Clust…

200 papers

We present two families of Wilf-equivalences for consecutive and quasi-consecutive vincular patterns. These give new proofs of the classification of consecutive patterns of length $4$ and $5$. We then prove additional equivalences to…

Combinatorics · Mathematics 2023-06-22 Evan Chen , Shyam Narayanan

In the past few years powerful generalizations to the Euclidean k-means problem have been made, such as Bregman clustering [7], co-clustering (i.e., simultaneous clustering of rows and columns of an input matrix) [9,18], and tensor…

Data Structures and Algorithms · Computer Science 2009-11-09 Stefanie Jegelka , Suvrit Sra , Arindam Banerjee

We say that a permutation $\pi=\pi_1\pi_2\cdots \pi_n \in \mathfrak{S}_n$ has a peak at index $i$ if $\pi_{i-1} < \pi_i > \pi_{i+1}$. Let $\mathcal{P}(\pi)$ denote the set of indices where $\pi$ has a peak. Given a set $S$ of positive…

Combinatorics · Mathematics 2016-05-06 Alexander Diaz-Lopez , Pamela E. Harris , Erik Insko , Mohamed Omar

We consider generalisations of the elliptic Calogero--Moser systems associated to complex crystallographic groups in accordance to [1]. In our previous work [2], we proposed these systems as candidates for Seiberg--Witten integrable systems…

High Energy Physics - Theory · Physics 2026-03-17 Philip C. Argyres , Oleg Chalykh , Yongchao Lü

Inversion sequences are integer sequences $e=e_{1}e_{2}\dots e_{n}$ such that $0\leq e_{i}<i$ for each $i$. The study of patterns in inversion sequences was initiated by Corteel--Martinez--Savage--Weselcouch and Mansour--Shattuck in the…

Combinatorics · Mathematics 2019-06-19 Juan S. Auli , Sergi Elizalde

We present Causal Posterior Estimation (CPE), a novel method for Bayesian inference in simulator models, i.e., models where the evaluation of the likelihood function is intractable or too computationally expensive, but where one can…

Machine Learning · Computer Science 2025-05-28 Simon Dirmeier , Antonietta Mira

In this paper, we study the pattern occurrence in $k$-ary words. We prove an explicit upper bound on the number of $k$-ary words avoiding any given pattern using a random walk argument. Additionally, we reproduce several already known…

Combinatorics · Mathematics 2022-12-22 Toufik Mansour , Reza Rastegar

One of the main challenges in data mining is choosing the optimal number of clusters without prior information. Notably, existing methods are usually in the philosophy of cluster validation and hence have underlying assumptions on data…

Computer Vision and Pattern Recognition · Computer Science 2026-03-31 Ruilin Zhang , Haiyang Zheng , Hongpeng Wang

Let $\Omega$ be the set of odd positive integers and let $S:\Omega \rightarrow \Omega$ be the Syracuse function. It is proved that, for every permutation $\sigma$ of $(1,2,3)$, the set of triples of the form $(m,S(m),S^2(m))$ with…

Number Theory · Mathematics 2024-09-26 Melvyn B. Nathanson

We study cluster algebra of affine type $A_1^{(1)}$ by using two methods including counting the numbers of perfect matchings on snake graphs and compatible pairs on maximal Dyck paths. We find that the sum of coefficients of the terms in…

Combinatorics · Mathematics 2023-12-14 Ivan Ip , Duy Phan

We consider two related problems arising from a question of R. Graham on quasirandom phenomena in permutation patterns. A ``pattern'' in a permutation $\sigma$ is the order type of the restriction of $\sigma : [n] \to [n]$ to a subset $S…

Combinatorics · Mathematics 2008-01-29 Joshua Cooper , Andrew Petrarca

A set $S$ of permutations is forcing if for any sequence $\{\Pi_i\}_{i \in \mathbb{N}}$ of permutations where the density $d(\pi,\Pi_i)$ converges to $\frac{1}{|\pi|!}$ for every permutation $\pi \in S$, it holds that $\{\Pi_i\}_{i \in…

Combinatorics · Mathematics 2021-10-15 Martin Kurecka

For a classical group over a non-archimedean local field of odd residual characteristic p, we prove that two cuspidal types, defined over an algebraically closed field C of characteristic different from p, intertwine if and only if they are…

Representation Theory · Mathematics 2020-09-01 Robert Kurinczuk , Daniel Skodlerack , Shaun Stevens

In this paper we introduce a new approach for organizing algebras of global dimension at most 2. We introduce the notion of cluster equivalence for these algebras, based on whether their generalized cluster categories are equivalent. We are…

Representation Theory · Mathematics 2012-03-08 Claire Amiot , Steffen Oppermann

We study the complexity of the decision problem known as Permutation Pattern Matching, or PPM. The input of PPM consists of a pair of permutations $\tau$ (the `text') and $\pi$ (the `pattern'), and the goal is to decide whether $\tau$…

Combinatorics · Mathematics 2021-08-10 Vít Jelínek , Michal Opler , Jakub Pekárek

We give an affirmative answer to Wilf's conjecture for numerical semigroups satisfying 2 \nu \geq m, where \nu and m are respectively the embedding dimension and the multiplicity of a semigroup. The conjecture is also proved when m \leq 8…

Commutative Algebra · Mathematics 2012-12-18 Alessio Sammartano

Inspired by the tropical duality in cluster algebras, we introduce c-vectors for finite-dimensional algebras via $\tau$-tilting theory. Let $A$ be a finite-dimensional algebra over a field $k$. Each c-vector of $A$ can be realized as the…

Representation Theory · Mathematics 2018-09-11 Changjian Fu

Various coordinate rings of varieties appearing in the theory of Poisson Lie groups and Poisson homogeneous spaces belong to the large, axiomatically defined class of symmetric Poisson nilpotent algebras, e.g. coordinate rings of Schubert…

Commutative Algebra · Mathematics 2018-01-24 K. R. Goodearl , M. T. Yakimov

This paper studies inference in cluster randomized trials where treatment status is determined according to a "matched pairs" design. Here, by a cluster randomized experiment, we mean one in which treatment is assigned at the level of the…

Econometrics · Economics 2025-08-14 Yuehao Bai , Jizhou Liu , Azeem M. Shaikh , Max Tabord-Meehan

Clustering face images according to their identity has two important applications: (i) grouping a collection of face images when no external labels are associated with images, and (ii) indexing for efficient large scale face retrieval. The…

Computer Vision and Pattern Recognition · Computer Science 2018-07-30 Yichun Shi , Charles Otto , Anil K. Jain
‹ Prev 1 8 9 10 Next ›