English
Related papers

Related papers: A reduction formula for Waring numbers through gen…

200 papers

Let $G$ be an unicyclic graph of order $n$ and let $Q_G(x)= det(xI-Q(G))={matrix} \sum_{i=1}^n (-1)^i \varphi_i x^{n-i}{matrix}$ be the characteristic polynomial of the signless Laplacian matrix of a graph $G$. We give some transformations…

Combinatorics · Mathematics 2012-12-21 Jie Zhang , Xiao-Dong Zhang

Let $(\alpha_n(a,k),\beta_n(a,k))$ be a WP-Bailey pair. Assuming the limits exist, let \[ (\alpha_n^*(a),\beta_n^*(a))_{n\geq 1} = \lim_{k \to 1}\left(\alpha_n(a,k),\frac{\beta_n(a,k)}{1-k}\right)_{n\geq 1} \] be the \emph{derived}…

Number Theory · Mathematics 2019-01-18 James Mc Laughlin

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…

Combinatorics · Mathematics 2017-05-17 David Conlon , Jacob Fox , Choongbum Lee , Benny Sudakov

Let $m$ be a positive integer, $q$ be a prime power, and $\mathrm{PG}(2,q)$ be the projective plane over the finite field $\mathbb F_q$. Finding complete $m$-arcs in $\mathrm{PG}(2,q)$ of size less than $q$ is a classical problem in finite…

Combinatorics · Mathematics 2020-07-03 Daniele Bartoli , Giacomo Micheli

The first known families of cages arised from the incidence graphs of generalized polygons of order $q$, $q$ a prime power. In particular, $(q+1,6)$--cages have been obtained from the projective planes of order $q$. Morever, infinite…

Combinatorics · Mathematics 2012-11-13 M. Abreu , G. Araujo-Pardo , C. Balbuena , D. Labbate , J. Salas

In this paper, we prove a criterion for complexity in $g$-ary expansions of a rational fraction $a/b<1$ with gcd$(a,b)=1$. We prove that for any purely periodic proper fraction $a/b$ and all $j\geq 1$, each sequence of $j$ digits occurs in…

Number Theory · Mathematics 2022-10-14 Josefina López , Peter Stoll

The Gauss decompositions of the quantum groups, related to classical Lie groups and supergroups are considered by the elementary algebraic and $R$-matrix methods. The commutation relations between new basis generators (which are introduced…

q-alg · Mathematics 2008-02-03 E. V. Damaskinsky , P. P. Kulish , M. A. Sokolov

For integer $k\geq2$ and prime power $q$, the algebraic bipartite graph $D(k,q)$ proposed by Lazebnik and Ustimenko (1995) is meaningful not only in extremal graph theory but also in coding theory and cryptography. This graph is…

Combinatorics · Mathematics 2022-07-27 Ming Xu , Xiaoyan Cheng , Yuansheng Tang

Killing forms on finite groups arise as examples of braided Killing forms on braided Lie algebras. For a finite group $G$ and a $G$-stable subset $\mathcal{C}$, the Killing form associated with $\mathbb{C}[\mathcal{C}]$ is given by…

Group Theory · Mathematics 2025-07-25 Kevin Ivan Piterman , Charlotte Roelants

We prove that a general polynomial vector $(f_1, f_2, f_3)$ in three homogeneous variables of degrees $(3,3,4)$ has a unique Waring decomposition of rank 7. This is the first new case we are aware, and likely the last one, after five…

Algebraic Geometry · Mathematics 2018-01-23 Elena Angelini , Francesco Galuppi , Massimiliano Mella , Giorgio Ottaviani

The study of bipartite maps (or Grothendieck's dessins d'enfants) is closely connected with geometry, mathematical physics and free probability. Here we study these objects from their permutation factorization formulation using a novel…

Combinatorics · Mathematics 2024-10-08 Ricky X. F. Chen

In this paper, we consider Griesmer codes, namely those linear codes meeting the Griesmer bound. Let $C$ be an $[n,k,d]_q$ Griesmer code with $q=p^f$, where $p$ is a prime and $f\ge1$ is an integer. In 1998, Ward proved that for $q=p$, if…

Combinatorics · Mathematics 2025-06-10 Haihua Deng , Hexiang Huang , Qing Xiang

For integer $k\geq2$ and prime power $q$, the algebraic bipartite graph $D(k,q)$ proposed by Lazebnik and Ustimenko (1995) is meaningful not only in extremal graph theory but also in coding theory and cryptography. This graph is…

Combinatorics · Mathematics 2022-09-07 Ming Xu , Xiaoyan Cheng , Yuansheng Tang

In this paper, several infinite families of codes over the extension of non-unital non-commutative rings are constructed utilizing general simplicial complexes. Thanks to the special structure of the defining sets, the principal parameters…

Information Theory · Computer Science 2024-07-16 Yanan Wu , Tingting Pang , Nian Li , Yanbin Pan , Xiangyong Zeng

It is known that the Wadge reducibility of regular $\omega$-languages is efficiently decidable (Krishnan et al., 1995), (Wilke, Yoo, 1995). In this paper we study analogous problem for regular k-partitions of $\omega$-languages. In the…

Formal Languages and Automata Theory · Computer Science 2024-09-12 Vladimir Podolskii , Victor Selivanov

We give another proof of a theorem of D. Prasad (Theorem 2, \textit{Israel J. Math.} 2016), which is also a classical result of Littlewood--Richardson (Theorem VI, \textit{Q. J. Math.} 1934). For integers $m,n \ge 2$, this result calculates…

Representation Theory · Mathematics 2026-04-07 Chayan Karmakar

Let C be a general connected, smooth, projective curve of positive genus g. For each nonnegative integer i we give formulas for the number of pairs (P,Q) em C x C off the diagonal such that (g+i-1)Q-(i+1)P is linearly equivalent to an…

Algebraic Geometry · Mathematics 2007-05-23 Caterina Cumino , Eduardo Esteves , Letterio Gatto

We compute the characters of real irreducible representations of SL(2,q), the special linear group on q letters, for an odd prime $q$. Moreover, we give the dimensions of these irreducible representations under the actions of cyclic…

Representation Theory · Mathematics 2019-08-26 Piotr Mizerka

Let $q$ be a power of a prime $p$, let $G$ be a finite Chevalley group over $\mathbb{F}_q$ and let $U$ be a Sylow $p$-subgroup of $G$; we assume that $p$ is not a very bad prime for $G$. We explain a procedure of reduction of irreducible…

Representation Theory · Mathematics 2016-08-18 Simon M. Goodwin , Tung Le , Kay Magaard , Alessandro Paolini

For $q\in\mathbb{R}$, the $Q$-matrix $Q=Q_q$ of a connected simple graph $G=(V,E)$ is $Q_q=(q^{\partial(x,y)})_{x,y\in V}$, where $\partial$ denotes the path-length distance. Describing the set $\pi(G)$ consisting of those $q\in \mathbb{R}$…

Combinatorics · Mathematics 2023-05-09 Hajime Tanaka
‹ Prev 1 8 9 10 Next ›