English
Related papers

Related papers: Packing $A$-paths of length zero modulo a prime

200 papers

Let $k$ be a field of characteristic $p > 0$. For $G$ an elementary abelian $p$-group, there exist collections of permutation module such that if $C^*$ is any exact bounded complex whose terms are sums of copies of modules from the…

Group Theory · Mathematics 2020-07-10 David J. Benson , Jon F. Carlson

For a given finite graph $G$ of minimum degree at least $k$, let $G_{p}$ be a random subgraph of $G$ obtained by taking each edge independently with probability $p$. We prove that (i) if $p \ge \omega/k$ for a function $\omega=\omega(k)$…

Combinatorics · Mathematics 2013-05-28 Michael Krivelevich , Choongbum Lee , Benny Sudakov

Let G be a finite group with identity e and H \neq \{e\} be a subgroup of G. The generalized non-coprime graph GAmma_{G,H} of G with respect to H is the simple undirected graph with G - \{e \}\) as the vertex set and two distinct vertices a…

Group Theory · Mathematics 2022-08-04 S. Anukumar Kathirvel , Peter J. Cameron , T. Tamizh Chelvam

For a simple graph $G$, let $n$ and $m$ denote the number of vertices and edges in $G$, respectively. The Erd\H{o}s-Gallai theorem for paths states that in a simple $P_k$-free graph, $m \leq \frac{n(k-1)}{2}$, where $P_k$ denotes a path…

Combinatorics · Mathematics 2025-05-08 Rajat Adak , L. Sunil Chandran

Call a simple graph $H$ of order $n$ well-separable, if by deleting a separator set of size $o(n)$ the leftover will have components of size at most $o(n)$. We prove, that bounded degree well-separable spanning subgraphs are easy to embed:…

Combinatorics · Mathematics 2007-07-18 Béla Csaba

We obtain an asymptotic upper bound for the product of the $p$-parts of the orders of certain composition factors of a finite group acting completely reducibly and faithfully on a finite vector space of order divisible by a prime $p$. An…

Group Theory · Mathematics 2023-06-05 Attila Maróti , Saveliy V. Skresanov

For a discrete group $\Gamma$ satisfying some finiteness conditions we give a Bredon projective resolution of the trivial module in terms of projective covers of the chain complex associated to certain posets of subgroups. We use this to…

Group Theory · Mathematics 2012-02-27 Conchita Martínez-Pérez

Given a finite group $G$, the generating graph $\Gamma(G)$ of $G$ has as vertices the (nontrivial) elements of $G$ and two vertices are adjacent if and only if they are distinct and generate $G$ as group elements. In this paper we…

Group Theory · Mathematics 2017-05-24 Andrea Lucchini , Claude Marion

The partition function of an N=2 gauge theory in the Omega-background satisfies, for generic value of the parameter beta=-eps_1/eps_2, the, in general extended, but otherwise beta-independent, holomorphic anomaly equation of special…

High Energy Physics - Theory · Physics 2011-01-04 Daniel Krefl , Johannes Walcher

For any relatively prime integers $r$ and $s$, let $a_{r,s}(n)$ denote the number of $(r,s)$-regular partitions of a positive integer of $n$ into distinct parts. Prasad and Prasad (2018) proved many infinite families of congruences modulo 2…

Number Theory · Mathematics 2021-07-01 Rinchin Drema , Nipen Saikia

An ordered graph is a graph with a linear ordering on its vertex set. We prove that for every positive integer $k$, there exists a constant $c_k>0$ such that any ordered graph $G$ on $n$ vertices with the property that neither $G$ nor its…

Combinatorics · Mathematics 2020-04-10 János Pach , István Tomon

In the 1960s, Erd\H{o}s and P\'osa proved that there is a packing-covering duality for cycles in graphs. As part of the graph minor project, Robertson and Seymour greatly extended this: there is such a duality for $H$-expansions in graphs…

Combinatorics · Mathematics 2019-09-25 Henning Bruhn , Felix Joos , Oliver Schaudt

Algebras defined over fields of characteristic zero and positive characteristic usually do not behave the same way. However, for certain algebras, for example the group algebras, they behave the same way as the characteristic zero case at…

Representation Theory · Mathematics 2025-02-28 David J. Benson , Kay Jin Lim

Let $\underline{a}$ and $\underline{b}$ be primitive sequences over $\mathbb{Z}/(p^e)$ with odd prime $p$ and $e\ge 2$. For certain compressing maps, we consider the distribution properties of compressing sequences of $\underline{a}$ and…

Information Theory · Computer Science 2014-01-24 Yupeng Jiang , Dongdai Lin

In this article, we give a family of examples of algebras, showing that for every $n \geq 2$ and $m \geq 0$, there is an algebra displaying a path of n irreducible morphisms between indecomposable modules whose composite lies in the…

Representation Theory · Mathematics 2025-07-14 Viktor Chust , Flávio U. Coelho

In this note we show that the family of Cayley graphs of a finitely generated subgroup of ${\rm GL}_{n_0}(\mathbb{F}_p(t))$ modulo some admissible square-free polynomials is a family of expanders under certain algebraic conditions. Here is…

Group Theory · Mathematics 2022-03-09 Brian Longo , Alireza Salehi Golsefidy

Let $p$ be any odd prime number. Let $k$ be any positive integer such that $2\leq k\leq [\frac{p+1}3]+1$. Let $S = (a_1,a_2,...,a_{2p-k})$ be any sequence in ${\Bbb Z}_p$ such that there is no subsequence of length $p$ of $S$ whose sum is…

Combinatorics · Mathematics 2007-05-23 W D Gao , A Panigrahi , R Thangadurai

Given a graph $G$, a subset $M$ of $V(G)$ is a module of $G$ if for each $v\in V(G)\setminus M$, $v$ is adjacent to all the elements of $M$ or to none of them. For instance, $V(G)$, $\emptyset$ and $\{v\}$ ($v\in V(G)$) are modules of $G$…

Combinatorics · Mathematics 2013-01-08 Abderrahim Boussaïri , Pierre Ille

This paper presents some basic theorems giving the structure of cyclic codes of length n over the ring of integers modulo p^a and over the p-adic numbers, where p is a prime not dividing n. An especially interesting example is the 2-adic…

Combinatorics · Mathematics 2007-07-16 A. R. Calderbank , N. J. A. Sloane

Let $p$ be a prime number. Irreducible cyclic codes of length $p^2-1$ and dimension $2$ over the integers modulo $p^h$ are shown to have exactly two nonzero Hamming weights. The construction uses the Galois ring of characteristic $p^h$ and…

Information Theory · Computer Science 2019-11-19 Minjia Shi , Tor Helleseth , Patrick Sole
‹ Prev 1 4 5 6 7 8 10 Next ›