Related papers: Special Graphs

To each finite frame $\varphi$ in an inner product space $\mathcal{H}$ we associate a simple graph $G(\varphi)$, called {\it frame graph}, with the vectors of the frame as vertices and there is an edge between vertices $f$ and $g$ provided…

We give a formula for computing the characteristic polynomial for certain hyperplane arrangements in terms of the number of bipartite graphs of given rank and cardinality.

This article examines the nontrivial solutions of the congruence \[ (p-1)\cdots(p-r) \equiv -1 \pmod p. \] We discuss heuristics for the proportion of primes $p$ that have exactly $N$ solutions to this congruence. We supply numerical…

We characterize the bipartite graphs that minimize the (first-degree based) entropy, among all bipartite graphs of given size, or given size and (upper bound on the) order. The extremal graphs turn out to be complete bipartite graphs, or…

In this note, we describe several new examples of holomorphic modular forms on the group SU(2,1). These forms are distinguished by having weight $\frac{1}{3}$. We also describe a method for determining the levels at which one should expect…

An almost self-centered graph is a connected graph of order $n$ with exactly $n-2$ central vertices, and an almost peripheral graph is a connected graph of order $n$ with exactly $n-1$ peripheral vertices. We determine (1) the maximum girth…

We characterize the space of the so-called planar mixed automorphic forms of type $(\nu,\mu)$ with respect to an equivariant pair $(\rho,\tau)$ as the image, by an appropriate transform, of the usual (Landau) automorphic forms involving…

The Paley graph is a well-known self-complementary pseudo-random graph, defined over a finite field of odd order. We describe an attempt at an analogous construction using fields of even order. Some properties of the graph are noted, such…

In this paper, some particular rational maps P_n ---> P_n+1, called quadratic congruences, are studied. They appear in the theory of exceptional vector bundles on projective spaces.

We show that on any Riemann surface S of genus g>1 any nonsingular even spin bundle defines e-foloation of S. When a surface is hyperelliptic then all leaves of this foliation are finite and almost all of them consists of 2g+2 points.…

We study types that appear in ultraproducts that have distributions which can be thought of as a sequence of graphs. The property of having distributions that are captured by graphs is motivated by a commonality of $\mathrm{SOP}_2$-types…

This paper concerns finite groups of class (at most) two and of odd prime exponent $p$. Such a group is called special if the center lies within its derived group. Every group of class 2 and exponent $p$ can be uniquely expressed as the…

In this note, finite type epimorphisms of rings are characterized.

We consider nonregular graphs having precisely three distinct eigenvalues. The focus is mainly on the case of graphs having two distinct valencies and our results include constructions of new examples, structure theorems, valency…

We present an explicit formula for subregular characters (i.e, irreducible finite-dimensional complex characters of submaximal degree) of the unitriangular group over a finite field of sufficiently large characteristic.

Let $\pi$ be a cuspidal automorphic representation of $PGL_2(\mathbb{A}_\mathbb{Q})$ of arithmetic conductor $C$ and archimedean parameter $T$, and let $\phi$ be an $L^2$-normalized automorphic form in the space of $\pi$. The sup-norm…

Let P be an extraspecial p-group which is neither dihedral of order 8, nor of odd order p^3 and exponent p. Let G be a finite group having P as a Sylow p-subgroup. Then the mod-p cohomology ring of G coincides with that of the normalizer…

The fine 1-curve graph of a surface is a graph whose vertices are simple closed curves on the surface and whose edges connect vertices that intersect in at most one point. We show that the automorphism group of the fine 1-curve graph is…

For real application and theoretical investigation of ordinary hypergraphs and non-ordinary hypergraphs, researchers need to establish standard rules and feasible operating methods. We propose a visualization tool for investigating…

Using a notation of corner between edges when graph has a fixed rotation, i.e. cyclical order of edges around vertices, we define combinatorial objects - combinatorial maps as pairs of permutations, one for vertices and one for faces.…