English
Related papers

Related papers: Every 4-equivalenced association scheme is Frobeni…

200 papers

Let X be a coherent configuration associated with a transitive group G. In terms of the intersection numbers of X, a necessary condition for the point stabilizer of G to be a TI-subgroup, is established. Furthermore, under this condition, X…

Combinatorics · Mathematics 2018-11-30 Gang Chen , Ilia Ponomarenko

A graph on $n$ vertices is called pancyclic if it contains a cycle of every length $3\le l \le n$. Given a Hamiltonian graph $G$ with independence number at most $k$ we are looking for the minimum number of vertices $f(k)$ that guarantees…

Combinatorics · Mathematics 2018-09-21 Attila Dankovics

Let $G$ be a finite group and $\alpha(G)=\frac{|C(G)|}{|G|}$\,, where $C(G)$ denotes the set of cyclic subgroups of $G$. In this short note, we prove that $\alpha(G)\leq\alpha(Z(G))$ and we describe the groups $G$ for which the equality…

Group Theory · Mathematics 2020-03-16 Marius Tărnăuceanu

Xu and Wu proved that if every $5$-cycle of a planar graph $G$ is not simultaneously adjacent to $3$-cycles and $4$-cycles, then $G$ is $4$-choosable. In this paper, we improve this result as follows. Let $\{i, j, k, l\} = \{3,4,5,6\}.$ For…

Combinatorics · Mathematics 2017-09-15 Pongpat Sittitrai , Kittikorn Nakprasit

A numerical semigroup $S$ is coated with odd elements (Coe-semigroup), if $\left\{x-1, x+1\right\}\subseteq S$ for all odd element $x$ in $S$. In this note, we will study this kind of numerical semigroups. In particular, we are interested…

Commutative Algebra · Mathematics 2024-07-25 J. C. Rosales , M. B. Branco , M. A. Traesel

Given three pairwise coprime positive integers $a_1,a_2,a_3 \in \mathbb{Z}^+$ we show the existence of a relation between the sets of the first elements of the three quotients $\frac{\langle a_i,a_j \rangle}{a_k}$ that can be made for every…

Number Theory · Mathematics 2015-04-14 Alessio Moscariello

The purpose of this note is to provide a reference for the fact that the strong Frobenius number, in the sense of Eaton and Livesey, of a block of a finite group with a cyclic defect group is equal to one. This answers a question of Farrell…

Representation Theory · Mathematics 2018-05-24 Markus Linckelmann

We classify Frobenius forms, a special class of homogeneous polynomials in characteristic $p>0$, in up to five variables over an algebraically closed field. We also point out some of the similarities with quadratic forms.

Commutative Algebra · Mathematics 2022-05-17 Zhibek Kadyrsizova , Janet Page , Jyoti Singh , Karen E. Smith , Adela Vraciu , Emily E. Witt

A word is cubefree if it contains no non-empty subword of the form xxx. A morphism h : Sigma^* -> Sigma^* is k-uniform if h(a) has length k for all a in Sigma. A morphism is cubefree if it maps cubefree words to cubefree words. We show that…

Combinatorics · Mathematics 2009-04-14 James Currie , Narad Rampersad

Let ${\cal B}$ be a nontrivial biplane of order $k-2$ represented by symmetric canonical incidence matrix with trace $1+ \binom{k}{2}$. We proved that ${\cal B}$ includes a partially balanced incomplete design with association scheme of…

Combinatorics · Mathematics 2014-01-22 Ivica Martinjak

A signed graph is a pair $(G,\sigma)$, where $G$ is a graph and $\sigma: E(G)\rightarrow \{-, +\}$, called signature, is an assignment of signs to the edges. Given a signed graph $(G,\sigma)$ with no negative loops, a balanced…

Combinatorics · Mathematics 2025-04-18 Xiaolan Hu , Luis Kuffner , Jiaao Li , Reza Naserasr , Lujia Wang , Zhouningxin Wang , Xiaowei Yu

A graph is said to be cyclic $k$-edge-connected, if at least $k$ edges must be removed to disconnect it into two components, each containing a cycle. Such a set of $k$ edges is called a cyclic-$k$-edge cutset and it is called a trivial…

Combinatorics · Mathematics 2007-05-23 Klavdija Kutnar , Dragan Marusic

We study statistical properties of random numerical semigroups of a given genus. We analyze the graph of a typical numerical semigroup, understood as a function from $\mathbb{N}$ to $\mathbb{N}$. If $S$ is a numerical semigroup of genus…

Combinatorics · Mathematics 2026-04-30 Maria Bras-Amorós , Nathan Kaplan , Deepesh Singhal

A graph $\Gamma$ is $k$-connected-homogeneous ($k$-CH) if $k$ is a positive integer and any isomorphism between connected induced subgraphs of order at most $k$ extends to an automorphism of $\Gamma$, and connected-homogeneous (CH) if this…

Group Theory · Mathematics 2020-03-10 Alice Devillers , Joanna B. Fawcett , Cheryl E. Praeger , Jin-Xin Zhou

For a graph $G$ and a parameter $k$, we call a vertex $k$-enabling if it belongs both to a clique of size $k$ and to an independent set of size $k$, and we call it $k$-excluding otherwise. Motivated by issues that arise in secret sharing…

Data Structures and Algorithms · Computer Science 2025-09-03 Uriel Feige , Ilia Pauzner

Let A be a finite dimensional, unital, and associative algebra which is endowed with a non-degenerate and invariant inner product. We give an explicit description of an action of cyclic Sullivan chord diagrams on the normalized Hochschild…

Quantum Algebra · Mathematics 2007-05-23 Thomas Tradler , Mahmoud Zeinalian

We consider composite $n$ satisfying the congruence $$n \cdot \sigma_k(n) \equiv 2 \pmod{\phi(n)},$$ and show a "flanking" structure: $14$ appears in both $S_{k-1}$ and $S_{k+1}$ whenever certain values of $n$ appear in $S_k$; and,…

Number Theory · Mathematics 2025-12-23 Scott Duke Kominers

An algebraic structure is said to be congruence permutable if its arbitrary congruences $\alpha$ and $\beta$ satisfy the equation $\alpha \circ \beta =\beta \circ \alpha$, where $\circ$ denotes the usual composition of binary relations. For…

Group Theory · Mathematics 2018-02-27 Attila Nagy

This research explores the sum of divisors - $\sigma(n)$ - and the abundancy index given by the function $\frac{\sigma(n)}{n}$. We give a generalization of amicable pairs - feebly amicable pairs (also known as harmonious pairs), that is…

Number Theory · Mathematics 2022-08-16 Jamie Bishop , Abigail Bozarth , Rebekah Kuss , Benjamin Peet

Schwede proved very recently in arXiv:0901.1154 that in a quasiprojective scheme X with a fixed Frobenius splitting, there are only finitely many subschemes {Y} that are compatibly split. (A simpler proof has already since been given in…

Algebraic Geometry · Mathematics 2009-01-16 Allen Knutson
‹ Prev 1 4 5 6 7 8 10 Next ›