English
Related papers

Related papers: Connected Reduced Products

200 papers

We study (smooth, complex) Fano 4-folds X having a rational contraction of fiber type, that is, a rational map X-->Y that factors as a sequence of flips followed by a contraction of fiber type. The existence of such a map is equivalent to…

Algebraic Geometry · Mathematics 2020-06-24 Cinzia Casagrande

We extend the classical Feferman-Vaught theorem to logic for metric structures. This implies that the reduced powers of elementarily equivalent structures are elementarily equivalent, and therefore they are isomorphic under the Continuum…

Logic · Mathematics 2016-04-06 Saeed Ghasemi

A graph is reducible if it is the lexicographic product of two smaller non-trivial graphs. It is well-known a 1-planar graph with $n ~(\ge3)$ vertices has at most $4n-8$ edges, and a graph $G$ with $n$ vertices is optimal if $G$ has exactly…

Combinatorics · Mathematics 2024-12-20 Licheng Zhang , Yuanqiu Huang

Suppose that a $X$ is an \emph{unshielded} plane continuum (i.e., $X$ coincides with the boundary of the unbounded complementary component of $X$). Then there exists a \emph{finest monotone} map $m:X\to L$, where $L$ is a locally connected…

Dynamical Systems · Mathematics 2022-01-28 A. Blokh , L. Oversteegen , V. Timorin

Let X be a smooth complex Fano 4-fold. We show that if X has a small elementary contraction, then the Picard number rho(X) of X is at most 12. This result is based on a careful study of the geometry of X, on which we give a lot of…

Algebraic Geometry · Mathematics 2022-05-20 C. Casagrande

The zero forcing number of a graph $G$, denoted by $Z(G)$, is the minimum cardinality of a set $S$ of black vertices (where vertices in $V(G)\setminus S$ are colored white) such that $V(G)$ is turned black after finitely many applications…

Combinatorics · Mathematics 2017-02-20 I. Javaid , I. Irshad , M. Batool , Z. Raza

We consider bipartite graphs definable in o-minimal structures, in which the edge relation $G$ is a finite union of graphs of certain measure-preserving maps. We establish a fact on the existence of definable matchings with few short…

Logic · Mathematics 2023-05-10 Jana Maříková

A classical enumerative result states that, given a graph $G$ and a vertex $u$, the number of connected subgraphs of $G$ is equal to the number of orientations of $G$ such that every vertex can reach $u$ by a directed path. We show that…

Combinatorics · Mathematics 2026-05-18 Oliver Bernardi , Jonathan J. Fang

In this paper we study $F$-manifolds equipped with multiple flat connections (and multiple $F$-products), that are required to be compatible in a suitable sense. In the semisimple case we show that a necessary condition for the existence of…

Mathematical Physics · Physics 2021-11-16 Alessandro Arsie , Paolo Lorenzoni

One of the central aims of the Minimal Model Program is to show that a projective log canonical pair $(X,\Delta)$ with $K_X+\Delta$ pseudoeffective has a good model, i.e.\ a minimal model $(Y,\Delta_Y)$ such that $K_Y+\Delta_Y$ is…

Algebraic Geometry · Mathematics 2025-08-22 Vladimir Lazić

We study smooth, complex Fano 4-folds X with a rational contraction onto a 3-fold, namely a rational map X-->Y that factors as a sequence of flips X-->X' followed by a surjective morphism X'->Y with connected fibers, where Y is normal,…

Algebraic Geometry · Mathematics 2024-10-30 Cinzia Casagrande , Saverio Andrea Secci

For a category C we investigate the problem of when the coproduct $\bigoplus$ and the product functor $\prod$ from C^I to C are isomorphic for a fixed set I, or, equivalently, when the two functors are Frobenius functors. We show that for…

Category Theory · Mathematics 2009-09-29 Miodrag Cristian Iovanov

We discuss some notions of compactness and convergence relative to a specified family F of subsets of some topological space X. The two most interesting particular cases of our construction appear to be the following ones. (1) The case in…

General Topology · Mathematics 2011-06-07 Paolo Lipparini

Graph products of monoids provide a common framework for free products and direct products. Trace monoids are graph products of finitely generated free monoids. We investigate the interaction of certain finitary conditions with graph…

Rings and Algebras · Mathematics 2026-03-10 Dandan Yang , Victoria Gould

We define a reduced $\infty$-operad $\mathcal{P}$ to be $d$-connected if the spaces $\mathcal{P}\left(n\right)$, of $n$-ary operations, are $d$-connected for all $n\ge0$. Let $\mathcal{P}$ and $\mathcal{Q}$ be two reduced $\infty$-operads.…

Algebraic Topology · Mathematics 2019-10-30 Tomer Schlank , Lior Yanovski

Let $\kappa(G)$ be the connectivity of $G$. The Kronecker product $G_1\times G_2$ of graphs $G_1$ and $G_2$ has vertex set $V(G_1\times G_2)=V(G_1)\times V(G_2)$ and edge set $E(G_1\times G_2)=\{(u_1,v_1)(u_2,v_2):u_1u_2\in E(G_1),v_1v_2\in…

Combinatorics · Mathematics 2011-06-08 Wei Wang , Zhidan Yan

We call a function $f: X\to Y$ $P$-preserving if, for every subspace $A \subset X$ with property $P$, its image $f(A)$ also has property $P$. Of course, all continuous maps are both compactness- and connectedness-preserving and the natural…

General Topology · Mathematics 2018-01-22 I. Juhász , J. van Mill

We prove that if a separable metrizable $X$ is a union of two disjoint 0-dimensional sets $E$, $F$, $E$ is absolutely $G_{\delta}$ and $F$ is absolutely $F_{\sigma\delta}$ then there is a closed embedding $h$ into the union of countable…

General Topology · Mathematics 2025-03-25 Elżbieta Pol , Roman Pol , Mirosława Reńska

We prove that there exists a nonprincipal ultrafilter $\mathcal U$ on $\mathbb N$ such that for every countable (or separable) structure $B$ in a countable language the quotient map from the reduced product associated with the Fr\'echet…

Logic · Mathematics 2021-04-20 Ilijas Farah

Observability of an array of identical LTI systems with incommensurable output matrices is studied, where an array is called observable when identically zero relative outputs imply synchronized solutions for the individual systems. It is…

Dynamical Systems · Mathematics 2016-08-12 S. Emre Tuna