相关论文: Monomial Bases for Broken Circuit Complexes

Komj\'ath, Milner, and Polat investigated when a finitary matroid admits a partition into circuits. They defined the class of ``finite matching extendable'' matroids and showed in their compactness theorem that those matroids always admit…

We study the problem of rationality of an infinite series of components, the so-called Ein components, of the Gieseker-Maruyama moduli space $M(e,n)$ of rank 2 stable vector bundles with the first Chern class $e=0$ or -1 and all possible…

Let G be a simple complex algebraic group and let K be a reductive subgroup of G such that the coordinate ring of G/K is a multiplicity free G-module. We consider the G-algebra structure of C[G/K], and study the decomposition into…

We introduce a new family of pure simplicial complexes, called the $r$-co-connected complex of $G$ with respect to $A$, $\Sigma_r(A,G)$, where $r\geq 1$ is a natural number, $G$ is a simple graph, and $A$ is a subset of vertices.…

Consider the diagonal action of the special orthogonal group on the direct sum of a finite number of copies of the standard representation--the underlying field is assumed to be algebraically closed and of characteristic not equal to two.…

The closure of a graph $G$ is the graph $G^*$ obtained from $G$ by repeatedly adding edges between pairs of non-adjacent vertices whose degree sum is at least $n$, where $n$ is the number of vertices of $G$. The well-known Closure Lemma…

Fix a smooth projective curve over a field of characteristic zero and a finite set of punctures. Let G be a connected linear algebraic group. We prove that the moduli of G-bundles with logarithmic connections having fixed residue classes at…

This paper introduces two new notions of graded linear resolution and graded linear quotients, which generalize the concepts of linear resolution property and linear quotient for modules over the polynomial ring $A=k[x_1, \dots ,x_n]$.…

We show that the GCD of two univariate polynomials can be computed by (piece-wise) algebraic circuits of constant depth and polynomial size over any sufficiently large field, regardless of the characteristic. This extends a recent result of…

Let G < SL(V) be a finite group, V is finite dimensional over a field F, p=char F and S(V) is the symmetric algebra of V. We determine when the subring of G-invariants S(V)^G is a polynomial ring. As a consequence, we classify, if F is…

A graph $G$ is $H$-free if it does not contain an induced subgraph isomorphic to $H$. The study of the typical structure of $H$-free graphs was initiated by Erd\H{o}s, Kleitman and Rothschild, who have shown that almost all $C_3$-free…

Let K be a number field with ring of integers O, and let G be a finite-index subgroup of SL(n,O). Using a classical construction from the geometry of numbers and the theory of modular symbols, we exhibit a finite spanning set for the…

The goal of this paper is to introduce the notion of $G$-Frobenius manifolds for any finite group $G$. This work is motivated by the fact that any $G$-Frobenius algebra yields an ordinary Frobenius algebra by taking its $G$-invariants. We…

We continue [GbSh:568] (math.LO/0003164), proving a stronger result under the special continuum hypothesis (CH). The original question of Eklof and Mekler related to dual abelian groups. We want to find a particular example of a dual group,…

A class $\mathcal G$ of graphs is $\chi$-bounded if there is a function $f$ such that for every graph $G\in \mathcal G$ and every induced subgraph $H$ of $G$, $\chi(H)\le f(\omega(H))$. In addition, we say that $\mathcal G$ is polynomially…

A conjecture in algorithmic model theory predicts that the model-checking problem for first-order logic is fixed-parameter tractable on a hereditary graph class if and only if the class is monadically dependent. Originating in model theory,…

Let $\mathcal{F} $ be a pointwise almost periodic decomposition of a compact metrizable space $X$. Then $\mathcal{F} $ is $R$-closed if and only if $\hat{\mathcal{F}} $ is usc. Moreover, if there is a finite index normal subgroup $H$ of an…

Feigin-Stoyanovsky's type subspaces for affine Lie algebras of type $C_\ell^{(1)}$ have monomial bases with a nice combinatorial description. We describe bases of whole standard modules in terms of semi-infinite monomials obtained as "a…

Let G be a simple finite graph such that each vertex has an integer value and different vertices have different values. Let S be a finite non-empty set of primes. We call G an S-graph if any two vertices are connected by an edge if and only…

Questions at the intersection of the AdS/CFT correspondence and quantum information theory motivate the study of projectors in sequences of subalgebras of finite-dimensional commutative associative semisimple algebras $\mathcal{A}$,…