相关论文: Duality on hypermaps with symmetric or alternating…
The duality principle for group representations developed in \cite{DHL-JFA, HL_BLM} exhibits a fact that the well-known duality principle in Gabor analysis is not an isolated incident but a more general phenomenon residing in the context of…
The monotone duality problem is defined as follows: Given two monotone formulas f and g in iredundant DNF, decide whether f and g are dual. This problem is the same as duality testing for hypergraphs, that is, checking whether a hypergraph…
We characterize the geometrically doubling condition of a metric space in terms of the uniform $L^1$-boundedness of superaveraging operators, where uniform refers to the existence of bounds independent of the measure being considered.
Let $P$ be an $x$-monotone orthogonal polygon with $n$ vertices. We call $P$ a simple histogram if its upper boundary is a single edge; and a double histogram if it has a horizontal chord from the left boundary to the right boundary. Two…
Duality methods are used to generate explicit solutions to nonlinear Hodge systems, demonstrate the well-posedness of boundary value problems, and reveal, via the Hodge-B\"acklund transformation, underlying symmetries among superficially…
We observe that for planar graphs, the geometric duality relation generates both 2-isomorphism and abstract duality. This observation has the surprising consequence that for links, the equivalence relation defined by isomorphisms of…
A plane graph is called a rectangular graph if each of its edges can be oriented either horizontally or vertically, each of its interior regions is a four-sided region and all interior regions can be fitted in a rectangular enclosure. If…
This paper presents two algorithms. In their simplest form, the first algorithm decides the existence of a pointed homotopy between given simplicial maps f, g from X to Y and the second computes the group $[\Sigma X,Y]^*$ of pointed…
The paper presents a detailed description of duality for braided algebras, coalgebras, bialgebras, Hopf algebras and their modules and comodules in the infinite setting. Assuming that the dual objects exist, it is shown how a given braiding…
We consider specific examples of $\mathcal{N}$ = 2 supersymmetric quantum mechanical models and list out all the novel symmetries. In each case, we show the existence of two sets of discrete symmetries that correspond to the Hodge duality…
An explicit algorithm is presented for testing whether two non-directed graphs are isomorphic or not. It is shown that for a graph of n vertices, the number of n independent operations needed for the test is polynomial in n. A proof that…
We study various cases of dualities between $\cal{N}$$=1$ 5d supersymmetric gauge theories. We motivate the dualities using brane webs, and provide evidence for them by comparing the superconformal index. In many cases we find that the…
The traditional adjacency matrix of a mixed graph is not symmetric in general, hence its eigenvalues may be not real. To overcome this obstacle, several authors have recently defined and studied various Hermitian adjacency matrices of…
In both ${\cal N}=1$ and ${\cal N}=2$ supersymmetry, it is known that $\mathsf{Sp}(2n, {\mathbb R})$ is the maximal duality group of $n$ vector multiplets coupled to chiral scalar multiplets $\tau (x,\theta) $ that parametrise the Hermitian…
We display a family of Stone-type dualities linking categories of frames carrying pairs of modal operators to categories of spaces carrying a binary relation. Different notions of morphism used on the relational side lead to significant…
Given a point and an expanding map on the unit interval, we consider the set of points for which the forward orbit under this map is bounded away from the given point. For maps like multiplication by an integer modulo 1, such sets have full…
It is well known that a graph is bipartite if and only if the spectrum of its adjacency matrix is symmetric. In the present paper, this assertion is dissected into three separate matrix results of wider scope, which are extended also to…
Let $r \ge 2$ be a fixed constant and let $ {\mathcal H}$ be an $r$-uniform, $D$-regular hypergraph on $N$ vertices. Assume further that $ D \to \infty$ as $N \to \infty$ and that degrees of pairs of vertices in ${\mathcal H}$ are at most…
A vector field E on an F-manifold (M, o, e) is an eventual identity if it is invertible and the multiplication X*Y := X o Y o E^{-1} defines a new F-manifold structure on M. We give a characterization of such eventual identities, this being…
The spectrum of a graph is closely related to many graph parameters. In particular, the spectral gap of a regular graph which is the difference between its valency and second eigenvalue, is widely seen an algebraic measure of connectivity…