English
Related papers

Related papers: Hecke-Kiselman Monoids of Small Cardinality

200 papers

The aim of the present work is to systematically study homomorphisms of Hecke and Artin monoids and thus to develop their comprehensive theory. Our original motivation was the striking observation that parabolic projections of Hecke monoids…

Representation Theory · Mathematics 2024-10-16 Arkady Berenstein , Jacob Greenstein , Jian-Rong Li

Let H be a graded Hecke algebra with complex deformation parameters and Weyl group W. We show that the Hochschild, cyclic and periodic cyclic homologies of H are all independent of the parameters, and compute them explicitly. We use this to…

K-Theory and Homology · Mathematics 2010-02-02 Maarten Solleveld

If $f$ is an automorphism of a compact simply connected K\"ahler manifold with trivial canonical bundle that fixes a K\"ahler class, then the order of $f$ is finite. We apply this well known result to construct compact non-K\"ahler…

Algebraic Geometry · Mathematics 2012-11-30 Gunnar Þór Magnússon

This paper studies intersections of principal blocks of a finite group with respect to different primes. We first define the block graph of a finite group $G$, whose vertices are the prime divisors of $|G|$ and there is an edge between two…

Representation Theory · Mathematics 2017-07-20 Julian Brough , Yanjun Liu , Alessandro Paolini

For $1\le \ell<k/2$, we show that for sufficiently large $n$, every $k$-uniform hypergraph on $n$ vertices with minimum codegree at least $\frac n{2 (k-\ell)} $ contains a Hamilton $\ell$-cycle. This codegree condition is best possible and…

Combinatorics · Mathematics 2015-01-29 Jie Han , Yi Zhao

A graph $H$ is an induced minor of a graph $G$ if it can be obtained from an induced subgraph of $G$ by contracting edges. Otherwise, $G$ is said to be $H$-induced minor-free. Robin Thomas showed that $K_4$-induced minor-free graphs are…

Combinatorics · Mathematics 2018-01-23 Jarosław Błasiok , Marcin Kamiński , Jean-Florent Raymond , Théophile Trunck

We obtain the following characterization of $Q$-polynomial distance-regular graphs. Let $\G$ denote a distance-regular graph with diameter $d\ge 3$. Let $E$ denote a minimal idempotent of $\G$ which is not the trivial idempotent $E_0$. Let…

Combinatorics · Mathematics 2009-08-31 Aleksandar Jurisic , Paul Terwilliger , Arjana Zitnik

Given an unbounded domain $\Omega$ of a Hadamard manifold $M$, it makes sense to consider the problem of finding minimal graphs with prescribed continuous data on its cone-topology-boundary, i.e., on its ordinary boundary together with its…

Differential Geometry · Mathematics 2016-02-17 Miriam Telichevesky

A well-quasi-order is an order which contains no infinite decreasing sequence and no infinite collection of incomparable elements. In this paper, we consider graph classes defined by excluding one graph as contraction. More precisely, we…

Combinatorics · Mathematics 2016-12-20 Marcin Kamiński , Jean-Florent Raymond , Théophile Trunck

We study a finite-dimensional quotient of the Hecke algebra of type $H_n$ for general $n$, using a calculus of diagrams. This provides a basis of monomials in a certain set of generators. Using this, we prove a conjecture of C.K. Fan about…

q-alg · Mathematics 2007-05-23 R. M. Green

Let X be a normal variety such that $K_X$ is Q-Cartier, and let $f: X \rightarrow X$ be a finite surjective morphism of degree at least two. We establish a close relation between the irreducible components of the locus of singularities that…

Algebraic Geometry · Mathematics 2017-10-30 Amaël Broustet , Andreas Höring

Birget, Margolis, Meakin and Weil proved that a finitely generated subgroup $K$ of a free group is pure if and only if the transition monoid $M(K)$ of its Stallings automaton is aperiodic. In this paper, we establish further connections…

Group Theory · Mathematics 2022-12-13 Inês F. Guimarães

The mixed Hegselmann-Krause (HK) model covers the synchronous Hegselmann-Krause model, the asynchronous Hegselmann-Krause model and the Deffuant model. Previous study~\cite{mHK, mHK2} deals with the mixed HK model on finite graphs. In the…

Probability · Mathematics 2024-08-08 Hsin-Lun Li

In 2006, K\"{u}hn and Osthus showed that if a 3-graph H on n vertices has minimum co-degree at least (1/4 +o(1))n and n is even then H has a loose Hamilton cycle. In this paper, we prove that the minimum co-degree of n/4 suffices. The…

Combinatorics · Mathematics 2013-08-06 Andrzej Czygrinow , Theodore Molla

We provide a characterization of the positive monoids (i.e., additive submonoids of the nonnegative real numbers) that satisfy the finite factorization property. As a result, we establish that positive monoids with well-ordered generating…

Commutative Algebra · Mathematics 2021-12-03 Harold Polo

We give an "excluded minor" and a "structural" characterization of digraphs D that have the property that for every subdigraph H of D, the maximum number of disjoint circuits in H is equal to the minimum cardinality of a subset T of V(H)…

Combinatorics · Mathematics 2010-12-14 Bertrand Guenin , Robin Thomas

Suppose $G$ is a connected complex Lie group and $H$ is a closed complex subgroup such that $X := G/H$ is Kaehler and the codimension of the top non-vanishing homology group of $X$ with coefficients in $\mathbb Z_2$ is less than or equal to…

Complex Variables · Mathematics 2016-12-30 Seyed Ruhallah Ahmadi , Bruce Gilligan

Let $G$ denote a $Q$-polynomial distance-regular graph with diameter $D$ at least 4. Assume that the intersection numbers of $G$ satisfy $a_i=0$ for $0 \leq i \leq D-1$ and $a_D\neq 0$. We show that $G$ is a polygon, a folded cube, or an…

Combinatorics · Mathematics 2016-09-07 Michael S. Lang , Paul M. Terwilliger

Let $S$ be a regular minimal surface of general type over the field of complex numbers, and $\mathrm{Aut}_\mathbb{Q}(S)$ the subgroup of automorphisms acting trivially on $H^*(S,\mathbb{Q})$. It has been known since twenty years that…

Algebraic Geometry · Mathematics 2024-12-24 Jin-Xing Cai , Wenfei Liu

For a hypergraph $H=(V,\mathcal E)$, a subfamily $\mathcal C\subseteq \mathcal E$ is called a cover of the hypergraph if $\bigcup\mathcal C=\bigcup\mathcal E$. A cover $\mathcal C$ is called minimal if each cover $\mathcal…

Combinatorics · Mathematics 2020-04-09 Taras Banakh , Dominic van der Zypen