English
Related papers

Related papers: Singer difference sets and the projective norm gra…

200 papers

In this paper we give a very elementary proof that if A and B are subsets of {1,2,...,N}, each having at least 5N^{1 - (4(k-1))^{-1}} elements, then the sumset A+B has a k-term arithmetic progression.

Number Theory · Mathematics 2007-05-23 Ernie Croot

If V is a representation of a linear algebraic group G, a set S of G-invariant regular functions on V is called separating if the following holds: If two elements v,v' from V can be separated by an invariant function, then there is an f…

Commutative Algebra · Mathematics 2014-06-25 Martin Kohls , Hanspeter Kraft

Let $G$ be a group. The intersection graph of subgroups of $G$, denoted by $\mathscr{I}(G)$, is a graph with all the proper subgroups of $G$ as its vertices and two distinct vertices in $\mathscr{I}(G)$ are adjacent if and only if the…

Group Theory · Mathematics 2015-06-03 R. Rajkumar , P. Devi

Let $G$ be a finite group and $\text{cd}(G)$ denote the character degree set for $G$. The prime graph $\Delta(G)$ is a simple graph whose vertex set consists of prime divisors of elements in $\text{cd}(G)$, denoted $\rho(G)$. Two primes…

Representation Theory · Mathematics 2019-01-14 Donnie Munyao Kasyoki , Paul Odhiambo Oleche

The well-known Reifenberg theorem states that if a subset of $\mathbb{R}^n$ can be well approximated by $k$-planes at every point and every scale, then it is biH\"older homeomorphic to a $k$-disk. This article concerns a subset $S$ of…

Metric Geometry · Mathematics 2025-08-21 Jiaqi Zang

An invariant for cospectral graphs is a property shared by all cospectral graphs. In this paper, we establish three novel arithmetic invariants for cospectral graphs, revealing deep connections between spectral properties and combinatorial…

Combinatorics · Mathematics 2025-04-15 Yizhe Ji , Quanyu Tang , Wei Wang , Hao Zhang

Given a finite set satisfying condition $\mathcal{A}$, the subset selection problem asks, how large of a subset satisfying condition $\mathcal{B}$ can we find? We make progress on three instances of subset selection problems in planar point…

Combinatorics · Mathematics 2024-12-20 József Balogh , Felix Christian Clemen , Adrian Dumitrescu , Dingyuan Liu

We review and analyse techniques from the literature for extending a normed algebra, A to a normed algebra, B, so that B has interesting or desirable properties which A may lack. For example, B might include roots of monic polynomials over…

Functional Analysis · Mathematics 2007-05-23 Thomas William Dawson

In this note the notion of kernel of a representation of a semisimple Hopf algebra is introduced. Similar properties to the kernel of a group representation are proved in some special cases. In particular, every normal Hopf subalgebra of a…

Rings and Algebras · Mathematics 2007-10-18 S. Burciu

A graphic arrangement is a subarrangement of the braid arrangement whose set of hyperplanes is determined by an undirected graph. A classical result due to Stanley, Edelman and Reiner states that a graphic arrangement is free if and only if…

Combinatorics · Mathematics 2025-05-21 Takuro Abe , Lukas Kühne , Paul Mücksch , Leonie Mühlherr

We investigate $k$-nets with $k\geq 4$ embedded in the projective plane $PG(2,\mathbb{K})$ defined over a field $\mathbb{K}$; they are line configurations in $PG(2,\mathbb{K})$ consisting of $k$ pairwise disjoint line-sets, called…

Algebraic Geometry · Mathematics 2013-06-26 G. Korchmaros , G. P. Nagy , N. Pace

Given a graph H, we call a graph $\textit{H-free}$ if it does not contain H as a subgraph. The planar Tur\'an number of a graph H, denoted by $ex_{\mathcal{P}}(n, H)$, is the maximum number of edges in a planar H-free graph on n vertices. A…

Combinatorics · Mathematics 2025-07-17 Huiqing Liu , Tian Xie , Qin Zhao

The Harary-Hill Conjecture states that for $n\geq 3$ every drawing of $K_n$ has at least \begin{align*} H(n) :=…

Computational Geometry · Computer Science 2018-07-12 Petra Mutzel , Lutz Oettershagen

It is a classical fact that every $n$-element set of positive reals has at least $\binom{n+1}{2}+1$ distinct subset sums, with equality exactly for homogeneous arithmetic progressions (when $n\geq 4$). We establish stability versions of…

Combinatorics · Mathematics 2026-05-08 Ruben Carpenter , Colin Defant , Noah Kravitz

Let $f$ be a symmetric norm on ${\mathbb R}^n$ and let ${\mathcal B}({\mathcal H})$ be the set of all bounded linear operators on a Hilbert space ${\mathcal H}$ of dimension at least $n$. Define a norm on ${\mathcal B}({\mathcal H})$ by…

Functional Analysis · Mathematics 2022-02-11 Jor-Ting Chan , Chi-Kwong Li

We prove the Singer conjecture for varieties with semismall Albanese map and residually finite fundamental group.

Differential Geometry · Mathematics 2026-01-14 Luca F. Di Cerbo , Luigi Lombardi

We consider a so-called quantum graph with standard continuity and Kirchhoff vertex conditions where the Kirchhoff vertex condition is perturbed by Gaussian noise. We show that the quantum graph setting is very different from the classical…

Dynamical Systems · Mathematics 2025-12-23 Mohamed Fkirine , Mihály Kovács , Eszter Sikolya

Series-parallel (SP) graphs are binary edge-labeled graphs with a designated source and target vertex, built using serial and parallel composition. A set of graphs is recognizable if membership depends only on its image under a homomorphism…

Formal Languages and Automata Theory · Computer Science 2026-04-28 Marius Bozga , Radu Iosif , Florian Zuleger

Let G be a connected simple linear Lie group and H in G a symmetric subgroup such that the corresponding symmetric space G/H is non-compactly causal. We show that any irreducible unitary representation of G leads naturally to a net of…

Representation Theory · Mathematics 2023-09-22 Jan Frahm , Karl-Hermann Neeb , Gestur Olafsson

The problem Cover(H) asks whether an input graph G covers a fixed graph H (i.e., whether there exists a homomorphism G to H which locally preserves the structure of the graphs). Complexity of this problem has been intensively studied. In…

Combinatorics · Mathematics 2011-08-20 Ondřej Bílka , Jozef Jirásek , Pavel Klavík , Martin Tancer , Jan Volec
‹ Prev 1 3 4 5 6 7 10 Next ›