English
Related papers

Related papers: Connected Reduced Products

200 papers

Symmetric product orbifold theories are valuable due to their universal features at large $N$. Here we will demonstrate that they have features that are not as pervasive: we provide evidence of strange behaviour under deformations within…

High Energy Physics - Theory · Physics 2023-01-09 Nathan Benjamin , Suzanne Bintanja , Alejandra Castro , Jildou Hollander

An edge-colored graph $G$ is {\em rainbow connected} if any two vertices are connected by a path whose edges have distinct colors. The {\em rainbow connection} of a connected graph $G$, denoted $rc(G)$, is the smallest number of colors that…

Combinatorics · Mathematics 2008-09-16 Sourav Chakraborty , Eldar Fischer , Arie Matsliah , Raphael Yuster

The method of direct computation of universal (fibred) product in the category of commutative associative algebras of finite type with unity over a field is given and proven. The field of coefficients is not supposed to be algebraically…

Algebraic Geometry · Mathematics 2016-07-15 Nadezda V. Timofeeva

We study linkedness of Cartesian product of graphs and prove that the product of an $a$-linked and a $b$-linked graphs is $(a+b-1)$-linked if the graphs are sufficiently large. Further bounds in terms of connectivity are shown. We determine…

Combinatorics · Mathematics 2014-07-29 Gabor Meszaros

Let $A$ be a homogeneous C*-algebra and $\phi$ a state on $A.$ We show that if $\phi$ satisfies a certain faithfulness condition, then there is a net of finite-rank, unital completely positive, $\phi$-preserving maps on $A$ that tend to the…

Operator Algebras · Mathematics 2013-06-19 Caleb Eckhardt

We investigate several properties of Kronecker (direct, tensor) products of graphs that are planar and $3$-connected (polyhedral, $3$-polytopal). This class of graphs was recently characterised and constructed by the second author [15]. Our…

Combinatorics · Mathematics 2024-11-21 Ruben De March , Riccardo W. Maffucci

Let $G=(V,E)$ be a supply graph and $H=(V,F)$ a demand graph defined on the same set of vertices. An assignment of capacities to the edges of $G$ and demands to the edges of $H$ is said to satisfy the \emph{cut condition} if for any cut in…

Discrete Mathematics · Computer Science 2012-03-20 Amit Chakrabarti , Lisa Fleischer , Christophe Weibel

Let $\mathbbm{P}^{1,an}$ be the Berkovich projective line over a complete, algebraically closed, non-Archimedean field. Let $\phi$ be a degree $\geq 2$ rational map with potential good reduction, acting on $\mathbbm{P}^{1,an}$. In this…

Dynamical Systems · Mathematics 2026-01-13 Niladri Patra

We solve a long-standing conjecture by Barker, proving that the minimal and maximal tensor products of two finite-dimensional proper cones coincide if and only if one of the two cones is generated by a linearly independent set. Here, given…

Functional Analysis · Mathematics 2021-08-26 Guillaume Aubrun , Ludovico Lami , Carlos Palazuelos , Martin Plavala

Product structure theorems are a collection of recent results that have been used to resolve a number of longstanding open problems on planar graphs and related graph classes. One particularly useful version states that every planar graph…

Combinatorics · Mathematics 2024-06-17 Vida Dujmović , Gwenaël Joret , Piotr Micek , Pat Morin , David R. Wood

A set of reals $X$ is $\mathfrak{b}$-concentrated if it has cardinality at least $\mathfrak{b}$ and it contains a countable set $D\subseteq X$ such that each closed subset of $X$ disjoint with $D$ has size smaller than $\mathfrak{b}$. We…

General Topology · Mathematics 2025-11-13 Valentin Haberl , Piotr Szewczak , Lyubomyr Zdomskyy

We study the following version of cut sparsification. Given a large edge-weighted network $G$ with $k$ terminal vertices, compress it into a smaller network $H$ with the same terminals, such that every minimum terminal cut in $H$…

Data Structures and Algorithms · Computer Science 2019-10-08 Robert Krauthgamer , Havana , Rika

A graph class $\mathcal{G}$ admits product structure if there exists a constant $k$ such that every $G \in \mathcal{G}$ is a subgraph of $H \boxtimes P$ for a path $P$ and some graph $H$ of treewidth $k$. Famously, the class of planar…

Combinatorics · Mathematics 2024-09-04 Laura Merker , Lena Scherzer , Samuel Schneider , Torsten Ueckerdt

Let $M_{m,n}$ be the space of $m\times n$ real or complex rectangular matrices. Two matrices $A, B \in M_{m,n}$ are disjoint if $A^*B = 0_n$ and $AB^* = 0_m$. In this paper, a characterization is given for linear maps $\Phi: M_{m,n}…

Rings and Algebras · Mathematics 2019-07-16 Chi-Kwong Li , Ming-Cheng Tsai , Ya-Shu Wang , Ngai-Ching Wong

Given a finite group $G$ and positive integers $r$ and $s$, a problem of interest in algebra is determining the minimum cardinality of the product set $AB$, where $A$ and $B$ are subsets of $G$ such that $|A|=r$ and $|B|=s$. This problem…

Group Theory · Mathematics 2025-05-15 Fernando Andres Benavides , Wilson Fernando Mutis

Louveau and Rosendal [5] have shown that the relation of bi-embeddability for countable graphs as well as for many other natural classes of countable structures is complete under Borel reducibility for analytic equivalence relations. This…

Logic · Mathematics 2011-12-05 Sy-David Friedman , Luca Motto Ros

We establish a quantitative relationship between mixed de Rham classes and the geometric complexity of metric connections with totally skew torsion on product manifolds where both factors are compact oriented surfaces. For any…

Differential Geometry · Mathematics 2026-04-21 Alexander Pigazzini , Magdalena Toda

A compact polyhedron $X$ is said to have the Bounded Index Property for Homotopy Equivalence (BIPHE) if there is a finite bound $\mathcal{B}$ such that for any homotopy equivalence $f:X\rightarrow X$ and any fixed point class $\mathbf{F}$…

Geometric Topology · Mathematics 2019-09-04 Shengkui Ye , Qiang Zhang

In recent work, the authors developed a simple method of constructing topological spaces from certain well-behaved partially ordered sets -- those coming from sequences of relations between finite sets. This method associates a given poset…

General Topology · Mathematics 2025-09-11 Adam Bartoš , Tristan Bice , Alessandro Vignati

The pinning down number $pd(X)$ of a topological space $X$ is the smallest cardinal $\kappa$ such that for every neighborhood assignment $\mathcal{U}$ on $X$ there is a set of size $\kappa$ that meets every member of $\mathcal{U}$. Clearly,…

General Topology · Mathematics 2017-05-09 Istvan Juhász , Jan van Mill , Lajos Soukup , Zoltán Szentmiklóssy
‹ Prev 1 8 9 10 Next ›