中文
相关论文

相关论文: Random GF(q)-representable matroids are not (b,c)-…

200 篇论文

We investigate the linear chromatic number $\chi_{\text{lin}}(G(n,p))$ of the binomial random graph $G(n,p)$ on $n$ vertices in which each edge appears independently with probability $p=p(n)$. For dense random graphs ($np \to \infty$ as $n…

组合数学 · 数学 2023-11-16 Austin Eide , Paweł Prałat

Assume $ k $ is a positive integer, $ \lambda=\{k_1,k_2,...,k_q\} $ is a partition of $ k $ and $ G $ is a graph. A $\lambda$-assignment of $ G $ is a $ k $-assignment $ L $ of $ G $ such that the colour set $ \bigcup_{v\in V(G)} L(v) $ can…

组合数学 · 数学 2021-09-03 Yangyan Gu , Xuding Zhu

We develop some basic tools to work with representable matroids of bounded tree-width and use them to prove that, for any prime power $q$ and constant $k$, the characteristic polynomial of any loopless, $GF(q)$-representable matroid with…

组合数学 · 数学 2017-03-09 Carolyn Chun , Rhiannon Hall , Criel Merino , Steven Noble

Let K be a field of characteristic p>0, and let q be a power of p. We determine all polynomials f in K[t]\K[t^p] of degree q(q-1)/2 such that the Galois group of f(t)-u over K(u) has a transitive normal subgroup isomorphic to PSL_2(q),…

代数几何 · 数学 2013-10-08 Robert M. Guralnick , Michael E. Zieve

Let F* be the finite field of q elements and let P(n,q) be the projective space of dimension n-1 over F*. We construct a family H^{n}_{k,i} of combinatorial homology modules associated to P(n,q) over a coefficient field F field of…

组合数学 · 数学 2012-02-22 Johannes Siemons , Daniel Smith

We show that, if $\alpha > 0$ is a real number, $n \ge 2$ and $\ell \ge 2$ are integers, and $q$ is a prime power, then every simple matroid $M$ of sufficiently large rank, with no $U_{2,\ell}$-minor, no rank-$n$ projective geometry minor…

组合数学 · 数学 2012-10-17 Jim Geelen , Peter Nelson

Let $G$ be a usc decomposition of $S^n$, $H_G$ denote the set of nondegenerate elements and $\pi$ be the natural projection of $S^n$ onto $S^n/G$. Suppose that each point in the decomposition space has arbitrarily small neighborhoods with…

几何拓扑 · 数学 2013-12-05 Shijie Gu

We prove that the colored HOMFLY polynomial of a link, colored by symmetric or exterior powers of the fundamental representation, is q-holonomic with respect to the color parameters. As a result, we obtain the existence of an (a,q)…

几何拓扑 · 数学 2012-11-28 Stavros Garoufalidis

This article is a survey of matroid theory aimed at algebraic geometers. Matroids are combinatorial abstractions of linear subspaces and hyperplane arrangements. Not all matroids come from linear subspaces; those that do are said to be…

代数几何 · 数学 2014-09-12 Eric Katz

We classify the possibilities for the fixed field of the kernel of an irreducible three-dimensional Artin representation of $\Q$ with solvable image ramified at one prime by using the classification of the finite irreducible subgroups of…

数论 · 数学 2014-02-26 Jonah Leshin

It is shown that the finite dimensional irreducible representations of the quantum matrix algebra $ M_q(n) $ ( the coordinate ring of $ GL_q(n) $ ) exist only when q is a root of unity ( $ q^p = 1 $ ). The dimensions of these…

高能物理 - 理论 · 物理学 2007-05-23 Vahid Karimipour

Let $q$ be a prime power, and $d$ a positive integer. We study the proportion of irreducible characters of $\mathrm{GL}(n,q)$ whose values evaluated on a fixed matrix $g$ are divisible by $d$. As $n$ approaches infinity, this proportion…

表示论 · 数学 2024-08-28 Varun Shah , Steven Spallone

Fix positive integers $p$ and $q$ with $2 \leq q \leq {p \choose 2}$. An edge-coloring of the complete graph $K_n$ is said to be a $(p, q)$-coloring if every $K_p$ receives at least $q$ different colors. The function $f(n, p, q)$ is the…

组合数学 · 数学 2017-05-17 David Conlon , Jacob Fox , Choongbum Lee , Benny Sudakov

We classify the finite-dimensional irreducible linear representations of the Baumslag-Solitar groups BS(p,q) = < a, b | a b^p = b^q a > for relatively prime p and q. The general strategy of the argument is to consider the matrix group given…

群论 · 数学 2012-09-19 Daniel McLaury

An untouchable set in a projective plane is a set of points such that no line of the plane meets the set in exactly one point. Recently, H\'eger and Nagy (Avoiding Secants of Given Size in Finite Projective Planes, J. Combin. Des.…

组合数学 · 数学 2025-05-14 Jeremy M. Dover

A c-coloring of G(n,m)=n x m is a mapping of G(n,m) into {1,...,c} such that no four corners forming a rectangle have the same color. In 2009 a challenge was proposed via the internet to find a 4-coloring of G(17,17). This attracted…

计算复杂性 · 计算机科学 2022-12-13 Daniel Apon , William Gasarch , Kevin Lawler

The construction approach proposed in the previous paper Ref. 1 allows us there and in the present paper to construct at generic deformation parameter $q$ all finite--dimensional representations of the quantum Lie superalgebra…

高能物理 - 理论 · 物理学 2009-10-28 Nguyen Anh Ky , N. Stoilova

Let $G$ be a split reductive group with $\dim Z(G) \leq 1$. We show that for any prime $p$ that is large enough relative to $G$, there is a finitely ramified Galois representation $\rho \colon \Gamma_{\mathbb Q} \to G(\mathbb Z_p)$ with…

数论 · 数学 2022-09-15 Shiang Tang

We study elements of second order linear recurrence sequences $(G_n)_{n= 0}^{\infty}$ of polynomials in $\mathbb{C}[x]$ which are decomposable, i.e. representable as $G_n=g\circ h$ for some $g, h\in \mathbb{C}[x]$ satisfying…

数论 · 数学 2017-03-10 Clemens Fuchs , Christina Karolus , Dijana Kreso

A vertex coloring of a graph is nonrepetitive if there is no path in the graph whose first half receives the same sequence of colors as the second half. While every tree can be nonrepetitively colored with a bounded number of colors (4…

组合数学 · 数学 2021-12-23 Adam Gągol , Gwenaël Joret , Jakub Kozik , Piotr Micek