English
Related papers

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

200 papers

Let K be the kernel of an epimorphism G -> Z, where G is a finitely presented group. If K has infinitely many subgroups of index 2, 3, or 4, then it has uncountably many. Moreover, if K is the commutator subgroup of a classical knot group…

Geometric Topology · Mathematics 2007-05-23 Daniel S. Silver , Susan G. Williams

For a hypergraph $\mathcal{H}=(X,\mathcal{E})$ a \emph{support} is a graph $G$ on $X$ such that for each $E\in\mathcal{E}$, the induced subgraph of $G$ on the elements in $E$ is connected. If $G$ is planar, we call it a planar support. A…

Computational Geometry · Computer Science 2024-10-04 Ambar Pal , Rajiv Raman , Saurabh Ray , Karamjeet Singh

The N = 2, 4 superconformal symmetry constraints in d = 4 for four point functions of chiral primary 1/2-BPS operators are derived. The operators are described by symmetric traceless tensors of the internal R-symmetry group. A substantial…

High Energy Physics - Theory · Physics 2017-06-06 Michael Nirschl

We establish relations between the bandwidth and the treewidth of bounded degree graphs G, and relate these parameters to the size of a separator of G as well as the size of an expanding subgraph of G. Our results imply that if one of these…

Combinatorics · Mathematics 2009-10-19 Julia Böttcher , Klaas P. Pruessmann , Anusch Taraz , Andreas Würfl

We introduce a new one-variable polynomial invariant of graphs, which we call the skew characteristic polynomial. For an oriented simple graph, this is just the characteristic polynomial of its anti-symmetric adjacency matrix. For…

Combinatorics · Mathematics 2024-02-14 R. Dogra , S. Lando

We investigate the parameterized complexity of finding subgraphs with hereditary properties on graphs belonging to a hereditary graph class. Given a graph $G$, a non-trivial hereditary property $\Pi$ and an integer parameter $k$, the…

Data Structures and Algorithms · Computer Science 2021-01-26 David Eppstein , Siddharth Gupta , Elham Havvaei

A graph $G$ contains a graph $H$ as a pivot-minor if $H$ can be obtained from $G$ by applying a sequence of vertex deletions and edge pivots. Pivot-minors play an important role in the study of rank-width. Pivot-minors have mainly been…

Hermitian cubic norm structures were recently introduced in order to study the class of skew-dimension one structurable algebras (which are typically only defined over fields of characteristic different from $2$ and $3$) over arbitrary…

Group Theory · Mathematics 2025-06-18 Michiel Smet

In this paper we classify triangular semisimple and cosemisimple Hopf algebras over any algebraically closed field k. Namely, we construct, for each positive integer N, relatively prime to the characteristic of k if it is positive, a…

Quantum Algebra · Mathematics 2017-05-03 Pavel Etingof , Shlomo Gelaki

This paper analyses the construction of the kernel graph of a non-synchronizing transformation semigroup and introduces the inverse synchronization problem. Given a transformation semigroup $S\leq T_n$, we construct the kernel graph…

Combinatorics · Mathematics 2016-03-14 Artur Schaefer

In relation to the Erd\H os similarity problem (show that for any infinite set $A$ of real numbers there exists a set of positive Lebesgue measure which contains no affine copy of $A$) we give some new examples of infinite sets which are…

Classical Analysis and ODEs · Mathematics 2023-01-10 Mihail N. Kolountzakis

Let $\F_q^n$ be a vector space of dimension $n$ over the finite field $\F_q$. A $q$-analog of a Steiner system (briefly, a $q$-Steiner system), denoted $S_q[t,k,n]$, is a set $S$ of $k$-dimensional subspaces of $\F_q^n$ such that each…

Combinatorics · Mathematics 2013-05-08 Michael Braun , Tuvi Etzion , Patric Ostergard , Alexander Vardy , Alfred Wassermann

Given two $k$-graphs $H$ and $F$, a perfect $F$-packing in $H$ is a collection of vertex-disjoint copies of $F$ in $H$ which together cover all the vertices in $H$. In the case when $F$ is a single edge, a perfect $F$-packing is simply a…

Combinatorics · Mathematics 2016-09-21 Jie Han , Andrew Treglown

We consider the class F of 2-connected non-planar K_{3,3}-subdivision-free graphs that are embeddable in the projective plane. We show that these graphs admit a unique decomposition as a graph K_5 (the core) where the edges are replaced by…

Combinatorics · Mathematics 2010-12-23 Andrei Gagarin , Gilbert Labelle , Pierre Leroux

We study the linear algebra of finite subsets $S$ of a Segre variety $X$. In particular we classify the pairs $(S,X)$ with $S$ linear dependent and $\#(S)\le 5$. We consider an additional condition for linear dependent sets (no two of their…

Algebraic Geometry · Mathematics 2020-02-14 Edoardo Ballico

Graph product structure theory expresses certain graphs as subgraphs of the strong product of much simpler graphs. In particular, an elegant formulation for the corresponding structural theorems involves the strong product of a path and of…

Data Structures and Algorithms · Computer Science 2022-04-26 Michael A. Bekos , Giordano Da Lozzo , Petr Hliněný , Michael Kaufmann

This paper studies planar algebras of Jones' style associated with the Young graph. We first see that, given a positive real valued function on the Young graph, we may obtain a planar algebra whose structure is defined in terms of a state…

Combinatorics · Mathematics 2026-01-26 Shinji Koshida

We study the existence and construction of sparse supports for hypergraphs derived from subgraphs of a graph $G$. For a hypergraph $(X,\mathcal{H})$, a support $Q$ is a graph on $X$ s.t. $Q[H]$, the graph induced on vertices in $H$ is…

Combinatorics · Mathematics 2025-06-10 Rajiv Raman , Karamjeet Singh

Let $N$ be a nilpotent group normal in a group $G$. Suppose that $G$ acts transitively upon the points of a finite non-Desarguesian projective plane $\mathcal{P}$. We prove that, if $\mathcal{P}$ has square order, then $N$ must act…

Group Theory · Mathematics 2007-05-23 Nick Gill

We consider problems of the following type: given a graph $G$, how many edges are needed in the worst case for a sparse subgraph $H$ that approximately preserves distances between a given set of node pairs $P$? Examples include pairwise…

Data Structures and Algorithms · Computer Science 2021-05-10 Greg Bodwin
‹ Prev 1 4 5 6 7 8 10 Next ›