Related papers: Special Graphs

Special p-forms are forms which have components \phi_{\mu_1...\mu_p} equal to +1,-1 or 0 in some orthonormal basis. A p-form \phi\in \Lambda^p R^d is called democratic if the set of nonzero components {\phi_{\mu_1...\mu_p}} is symmetric…

A p-typical cover of a connected scheme on which p=0 is a finite etale cover whose monodromy group (i.e., the Galois group of its normal closure) is a p-group. The geometry of such covers exhibits some unexpectedly pleasant behaviors;…

We define the \emph{occurrence graph} $G_p(\pi$) of a pattern $p$ in a permutation $\pi$ as the graph with the occurrences of $p$ in $\pi$ as vertices and edges between the vertices if the occurrences differ by exactly one element. We then…

For a given graph $G$, Budzik, Gaiotto, Kulp, Wang, Williams, Wu, Yu, and the first author studied a ''topological'' differential form $\alpha_G$, which expresses violations of BRST-closedness of a quantum field theory along a single…

A graph $G$ is primarily orientable if it is possible to orient its edges in such a way that the resulting oriented graph is prime, i.e., indecomposable under modular decomposition. We characterize primarily orientable graphs.

We give examples of cohomological automorphic forms for unitary groups which are $p$-adically rigid.

Let $p$ be a prime. We discuss $p$-adic properties of various arithmetical functions related to the coefficients of modular form and generating functions. Modular forms are considered as a tool of solving arithmetical problems. Examples of…

A new family of strongly regular graphs, called the general symplectic graphs $Sp(2\nu, q)$, associated with nonsingular alternate matrices is introduced. Their parameters as strongly regular graphs, their chromatic numbers as well as their…

A pair of orthonormal bases is called mutually unbiased if all mutual overlaps between any element of one basis with an arbitrary element of the other basis coincide. In case the dimension, $d$, of the considered Hilbert space is a power of…

We study finite groups which possess a strongly p-embedded subgroup for some odd prime p. The main results of the paper will be applied in the ongoing project to classify the simple groups of local characteristic p.

This paper studies dyadic singular integral forms associated with $r$-partite $r$-uniform hypergraphs such that all their connected components are complete. We characterize their $L^p$ boundedness by T(1)-type conditions in two different…

An automorphism of a group is called outer if it is not an inner automorphism. Let $G$ be a finite $p$-group. Then for every outer $p$-automorphism $\phi$ of $G$ the subgroup $C_G(\phi)=\{x\in G \;|\; x^\phi=x\}$ has order $p$ if and only…

In this paper, we aim to address the open questions raised in various recent papers regarding characterization of circulant graphs with three or four distinct eigenvalues in their spectra. Our focus is on providing characterizations and…

In this paper, we generalize the construction of strongly regular graphs in [Y. Tan et al., Strongly regular graphs associated with ternary bent functions, J. Combin.Theory Ser. A (2010), 117, 668-682] from ternary bent functions to $p$-ary…

We define a graph structure associated in a natural way to finite fields that nevertheless distinguishes between different models of isomorphic fields.

Let p be a singular point of a variety. Consider a resolution where the preimage of p is a simple normal crossing divisor E. The combinatorial structure of E is described by a cell complex D(E), called the dual graph or dual complex of E.…

We show that graphs, networks and other related discrete model systems carry a natural supersymmetric structure, which, apart from its conceptual importance as to possible physical applications, allows to derive a series of spectral…

Here we introduce the concept of special effect curve which permits to study, from a different point of view, special linear systems in P^2, i.e. linear system with general multiple base points whose effective dimension is strictly greater…

We characterize the r-graph with maximal p-spectral radius among the k-partite r-graphs of order n, and the 3-graph with maximal p-spectral radius among the k-chromatic 3-graphs of order n.

The paper aims at finding acyclic graphs under a given set of constraints. More specifically, given a propositional formula {\phi} over edges of a fixed-size graph, the objective is to find a model of {\phi} that corresponds to a graph that…