English
Related papers

Related papers: Structural properties and characterizations of $\m…

200 papers

In this paper, we extend the recently introduced concept of partially dual ribbon graphs to graphs. We then go on to characterize partial duality of graphs in terms of bijections between edge sets of corresponding graphs. This result…

Combinatorics · Mathematics 2012-03-01 Iain Moffatt

Let $G$ be a finite group. For some fixed prime $p$, let $\Gamma_p(G)$ be the common divisor graph built on the set of sizes of $p$-regular conjugacy classes of $G$: this is the simple undirected graph whose vertices are the class sizes of…

Group Theory · Mathematics 2026-01-14 Víctor Sotomayor

Motivated by the definition of the Gowers uniformity norms, we introduce and study a wide class of norms. Our aim is to establish them as a natural generalization of the $L_p$ norms. We shall prove that these normed spaces share many of the…

Combinatorics · Mathematics 2009-03-20 Hamed Hatami

Using the Bailey flow construction, we derive character identities for the N=1 superconformal models SM(p',2p+p') and SM(p',3p'-2p), and the N=2 superconformal model with central charge c=3(1-2p/p') from the nonunitary minimal models…

Mathematical Physics · Physics 2007-05-23 Lipika Deka , Anne Schilling

We derive the finite size dependence of the clustering coefficient of scale-free random graphs generated by the configuration model with degree distribution exponent $2<\gamma<3$. Degree heterogeneity increases the presence of triangles in…

Disordered Systems and Neural Networks · Physics 2015-06-05 Pol Colomer-de-Simon , Marian Boguna

For a subset $ S $ of $ \mathbb R^d$, $ S$-graphs are the intersection graphs of specific transformations of $ S $. The class of Burling graphs is a class of triangle-free graphs with arbitrarily large chromatic number that has attracted…

Combinatorics · Mathematics 2023-08-30 Pegah Pournajafi

We give bounds on the L(2,1)-labeling number of a simple graph in terms of its order and its maximum degree. We also describe an infinite class of graphs of which the elements have the highest L(2,1)-labeling numbers in terms of their…

Combinatorics · Mathematics 2013-11-08 Cole Franks

We characterize positive critical Hardy weights for general Laplacians on weighted graphs. We then apply this result to fractional Laplacians on general graphs and use the characterization to identify an optimal Hardy weight under suitable…

Mathematical Physics · Physics 2026-05-20 Philipp Hake , Matthias Keller , Felix Pogorzelski

We formulate the geometric P=W conjecture for singular character varieties. We establish it for compact Riemann surfaces of genus one, and obtain partial results in arbitrary genus. To this end, we employ non-Archimedean, birational and…

Algebraic Geometry · Mathematics 2022-05-18 Mirko Mauri , Enrica Mazzon , Matthew Stevenson

Well-graded families, extremal systems and maximum systems (the last two in the sense of VC-theory and Sauer-Shelah lemma on VC-dimension) are three important classes of set systems. This paper aims to study the notion of duality in the…

Combinatorics · Mathematics 2022-12-19 Alireza Mofidi

We develop a shape analysis for reasoning about relational properties of data structures. Both the concrete and the abstract domain are represented by hypergraphs. The analysis is parameterized by user-supplied indexed graph grammars to…

Programming Languages · Computer Science 2018-04-20 Hannah Arndt , Christina Jansen , Christoph Matheja , Thomas Noll

We present a new flavor of TAF-type (co)homology theories, which are p-local of height two and based on the isometry group of the odd unimodular hermitian lattice of signature (1,1) over the Gaussian integers. Using a suitable family of…

Algebraic Topology · Mathematics 2016-09-29 Hanno von Bodecker , Sebastian Thyssen

In this paper, we study the superscharacter theories of elementary abelian $p$-groups of order $p^2$. We show that the supercharacter theories that arise from the direct product construction and the $\ast$-product construction can be…

Group Theory · Mathematics 2020-07-27 Shawn T. Burkett , Mark L. Lewis

We present an order-theoretic approach to the study of countably infinite locally 2-arc-transitive bipartite graphs. Our approach is motivated by techniques developed by Warren and others during the study of cycle-free partial orders. We…

Group Theory · Mathematics 2014-06-09 Robert D. Gray , John K. Truss

In this paper, we introduce and investigate a class P of continuous and periodic functions on R. The class P is defined so that second-order central differences of a function satisfy some concavity-type estimate. Although this definition…

Classical Analysis and ODEs · Mathematics 2019-08-05 Yasuhiro Fujita , Nao Hamamuki , Antonio Siconolfi , Norikazu Yamaguchi

We show that the topological classification and the smooth classification are generically the same for certain families of plane curves in a semi-local case(the double local case). Especially we give the normal form of transversely jointed…

Geometric Topology · Mathematics 2007-05-23 Jean Paul Dufour , Yasuhiro Kurokawa

Let $(\Sigma,p)$ be a pointed Riemann surface of genus $g\geq 1$. For any integer $k\geq 1$, we parametrize the space of meromorphic quadratic differentials on $\Sigma$ with a pole of order $(k+2)$ at $p$, having a connected critical graph…

Differential Geometry · Mathematics 2015-05-13 Subhojoy Gupta , Michael Wolf

Inspired by a recent work of Mesnager, we present several new infinite families of quadratic ternary bent, near-bent and 2-plateaued functions from some known quadratic ternary bent functions. Meanwhile, the distribution of the Walsh…

Information Theory · Computer Science 2015-08-17 Guangkui Xu , Xiwang Cao

For the natural two parameter filtration $(\mathcal{F}_\lambda : \lambda \in P)$ on the boundary of a triangle building we define a maximal function and a square function and show their boundedness on $L^p(\Omega_0)$ for $p \in (1,…

Functional Analysis · Mathematics 2018-03-16 Tim Steger , Bartosz Trojan

The class of 2K2-free graphs and its various subclasses have been studied in a variety of contexts. In this paper, we are concerned with the colouring of (P3UP2)-free graphs, a super class of 2K2-free graphs. We derive a O(w^3) upper bound…

Discrete Mathematics · Computer Science 2018-02-22 Arpitha P. Bharathi , Sheshayya A. Choudum