English
Related papers

Related papers: Duality for image and kernel partition regularity …

200 papers

This paper continues the authors' work on the question of unitary equivalence of matrices with entries in the complex-valued functions of a topological space (matrices over spaces). Specifically, we here consider the question of unitary…

Operator Algebras · Mathematics 2022-05-30 Greg Friedman , Efton Park

It was shown recently that entanglement of identical particles has a feature called dualism [Phys. Rev. Lett. 110, 140404 (2013)], which is fundamentally connected with quantum indistinguishability. Here we report an experiment that…

Quantum Physics · Physics 2016-11-18 J. -J. Ma , X. -X. Yuan , C. Zu , X. -Y. Chang , P. -Y. Hou , L. -M. Duan

Partial duality generalizes the fundamental concept of the geometric dual of an embedded graph. A partial dual is obtained by forming the geometric dual with respect to only a subset of edges. While geometric duality preserves the genus of…

Combinatorics · Mathematics 2013-11-18 Iain Moffatt

The kernel relation $K$ on the lattice $\mathcal{L}(\mathcal{CR})$ of varieties of completely regular semigroups has been a central component in many investigations into the structure of $\mathcal{L}(\mathcal{CR})$. However, apart from the…

Rings and Algebras · Mathematics 2020-07-08 Norman R. Reilly

In geometric analysis, an index theorem relates the difference of the numbers of solutions of two differential equations to the topological structure of the manifold or bundle concerned, sometimes using the heat kernels of two higher-order…

Spectral Theory · Mathematics 2009-11-13 S. A. Fulling , P. Kuchment , J. H. Wilson

We study partition properties for uncountable regular cardinals that arise by restricting partition properties defining large cardinal notions to classes of simply definable colourings. We show that both large cardinal assumptions and…

Logic · Mathematics 2018-07-03 Philipp Lücke

For each rank metric code $\mathcal{C}\subseteq \mathbb{K}^{m\times n}$, we associate a translation structure, the kernel of which is shown to be invariant with respect to the equivalence on rank metric codes. When $\mathcal{C}$ is…

Combinatorics · Mathematics 2017-04-20 Guglielmo Lunardon , Rocco Trombetti , Yue Zhou

We address the enumeration of q-coloured planar maps counted bythe number of edges and the number of monochromatic edges. We prove that the associated generating function is differentially algebraic,that is, satisfies a non-trivial…

Combinatorics · Mathematics 2025-04-11 Olivier Bernardi , Mireille Bousquet-Mélou

In theories with long-range forces like QED or perturbative gravity, only rates that include emitted soft radiation are non-vanishing. Independently of detector resolution, finite observables can only be obtained after integrating over the…

High Energy Physics - Theory · Physics 2019-07-31 Cesar Gomez , Raoul Letschka , Sebastian Zell

We explore complementarity between output and environment of a quantum channel (or, more generally, CP map), making an observation that the output purity characteristics for complementary CP maps coincide. Hence, validity of the…

Quantum Physics · Physics 2007-07-05 A. S. Holevo

Let $G$ be a complex connected reductive algebraic group that acts on a smooth complex algebraic variety $X$, and let $E$ be a $G$-equivariant algebraic vector bundle over $X$. A section of $E$ is regular if it is transversal to the zero…

Algebraic Topology · Mathematics 2021-05-06 Alexey Gorinov , Nikolay Konovalov

Explicit sufficient and necessary conditions for separability of $N$-dimensional rank two multiparty quantum mixed states are presented. A nonseparability inequality is also given, for the case where one of the eigenvectors corresponding to…

Quantum Physics · Physics 2015-06-26 Shao-Ming Fei , Xiu-Hong Gao , Xiao-Hong Wang , Zhi-Xi Wang , Ke Wu

In this paper, we introduce the concept of bikernel by monochromatic paths of a bicolored digraph. This concept is strongly motivated by the existing notions of kernels, kernels by monochromatic paths, and double stable augmented…

We obtain a condition describing when the quasimodular forms given by the Bloch-Okounkov theorem as $q$-brackets of certain functions on partitions are actually modular. This condition involves the kernel of an operator {\Delta}. We…

Number Theory · Mathematics 2020-11-10 Jan-Willem M. van Ittersum

Let $\Gamma$ denote a finite, connected graph with vertex set $X$. Fix $x \in X$ and let $\varepsilon \ge 3$ denote the eccentricity of $x$. For mutually distinct scalars $\{\theta^*_i\}_{i=0}^\varepsilon$ define a diagonal matrix…

Combinatorics · Mathematics 2025-03-05 Blas Fernández , Roghayeh Maleki , Štefko Miklavič , Giusy Monzillo

Connectedness and bipartiteness are basic properties of classical graphs, and the purpose of this paper is to investigate the case of quantum graphs. We introduce the notion of connectedness and bipartiteness of quantum graphs in terms of…

Operator Algebras · Mathematics 2024-07-31 Junichiro Matsuda

We study $k$-colored kernels in $m$-colored digraphs. An $m$-colored digraph $D$ has $k$-colored kernel if there exists a subset $K$ of its vertices such that (i) from every vertex $v\notin K$ there exists an at most $k$-colored directed…

We prove that for any $\ell_p$-norm in the plane with $1<p<\infty$ and for every infinite $\mathcal{M} \subset \mathbb{R}^2$, there exists a two-colouring of the plane such that no isometric copy of $\mathcal{M}$ is monochromatic. On the…

Combinatorics · Mathematics 2025-09-29 Nóra Frankl , Panna Gehér , Arsenii Sagdeev , Géza Tóth

Optimal matrices for problems involving the matrix numerical radius often have fields of values that are disks, a phenomenon associated with partial smoothness. Such matrices are highly structured: we experiment in particular with the…

Optimization and Control · Mathematics 2020-05-01 X. Y. Han , Adrian S. Lewis

This paper studies the kernelization complexity of graph coloring problems with respect to certain structural parameterizations of the input instances. We are interested in how well polynomial-time data reduction can provably shrink…

Data Structures and Algorithms · Computer Science 2015-03-19 Bart M. P. Jansen , Stefan Kratsch