中文
相关论文

相关论文: Collapsing along monotone poset maps

200 篇论文

Assume that the vertices of a graph $G$ are always operational, but the edges of $G$ fail independently with probability $q \in[0,1]$. The \emph{all-terminal reliability} of $G$ is the probability that the resulting subgraph is connected.…

组合数学 · 数学 2018-10-01 J. I. Brown , C. D. C. DeGagne

A non-zero constant Jacobian polynomial map $F=(P,Q):\mathbb{C}^2 \longrightarrow \mathbb{C}^2$ has a polynomial inverse if the component $P$ is a simple polynomial, i.e. if, when $P$ extended to a morphism $p:X\longrightarrow \mathbb{P}^1$…

代数几何 · 数学 2017-09-13 Nguyen Van Chau

Firstly, we invoke the weak convergence (resp. strong convergence) of translated basic methods involving nonexpansive operators to establish the weak convergence (resp. strong convergence) of the associated method with both perturbation and…

最优化与控制 · 数学 2022-03-29 Hui Ouyang

We study the continuous reducibility of isomorphism relations in the space of regresive functions in $\kappa^\kappa$. We show for inaccessible $\kappa$, that if $\mathcal{T}$ is a theory with less than $\kappa$ non-isomorphic models of size…

逻辑 · 数学 2026-05-26 Ido Feldman , Miguel Moreno

Motivated by questions about simplification of topology, we take a discrete approach to the dependency of simplifying operations, using methods based on combinatorial gradient dynamics. We interpret the filter in persistent homology as a…

We study decidability and complexity questions related to a continuous analogue of the Skolem-Pisot problem concerning the zeros and nonnegativity of a linear recurrent sequence. In particular, we show that the continuous version of the…

动力系统 · 数学 2009-04-23 Paul Bell , Jean-Charles Delvenne , Raphael Jungers , Vincent D. Blondel

Let $\overline{\mathbb{D}}$ be the closure of the unit disk $\mathbb{D}$ in the complex plane $\mathbb{C}$ and $g$ be a continuous function in $\overline{\mathbb{D}}$. In this paper, we discuss some characterizations of elliptic mappings…

复变函数 · 数学 2020-06-08 Shaolin Chen , Saminathan Ponnusamy

We show that if $X$ is a separable locally compact Hausdorff connected space with fewer than $\mathfrak c$ non-cut points, then $X$ embeds into a dendrite $D\subseteq \mathbb R ^2$, and the set of non-cut points of $X$ is a nowhere dense…

一般拓扑 · 数学 2019-09-25 David S. Lipham

We give conditions for a locally finite poset $P$ to have the property that for any functions $f:P\to {\bf C}$ and $g:P\to {\bf C}$ not identically zero and linked by the M\"obius inversion formula, the support of at least one of $f$ and…

组合数学 · 数学 2026-03-03 Marcel K. Goh

We introduce a fast and memory efficient approach to compute the persistent homology (PH) of a sequence of simplicial complexes. The basic idea is to simplify the complexes of the input sequence by using strong collapses, as introduced by…

计算几何 · 计算机科学 2018-10-01 Jean-Daniel Boissonnat , Siddharth Pritam , Divyansh Pareek

We consider the problem of constructing a weakly-continuous mapping extending continuous mapping defined on a dense set of a topological space to the entire space. Theorem on necessary and sufficient conditions for the existence of such an…

一般拓扑 · 数学 2026-03-04 Andrew Ryabikov

Let $D$ be a bounded strongly convex domain with smooth boundary in $\mathbb C^N$. Let $(\phi_t)$ be a continuous semigroup of holomorphic self-maps of $D$. We prove that if $p\in \partial D$ is an isolated boundary regular fixed point for…

复变函数 · 数学 2014-02-18 Marco Abate , Filippo Bracci

We prove that every set $A\subset\mathbb{Z}/p\mathbb{Z}$ with $\mathbb{E}_x\min(1_A*1_A(x),t)\le(2+\delta)t\mathbb{E}_x 1_A(a)$ is very close to an arithmetic progression. Here $p$ stands for a large prime and $\delta,t$ are small real…

组合数学 · 数学 2015-06-02 Przemysław Mazur

We give a bijective correspondence between the number of nilpotent matrices over a Boolean semiring and the number of directed acyclic graphs on ordered vertices. We then enumerate pairs of maps between two finite sets whose composites are…

组合数学 · 数学 2025-12-08 Weixi Chen , Mee Seong Im , Catherine Lillja , Nicolas Rugo

This paper discusses advances, due to the work of Cai, Naik, and Sivakumar and Glasser, in the complexity class collapses that follow if NP has sparse hard sets under reductions weaker than (full) truth-table reductions.

计算复杂性 · 计算机科学 2007-05-23 Christian Glasser , Lane A. Hemaspaandra

We prove the following generalization of Severi's Theorem: Let $X$ be a fixed complex variety. Then there exist, up to birational equivalence, only finitely many complex varieties $Y$ of general type of dimension at most three which admit a…

alg-geom · 数学 2014-12-02 Gerd Dethloff

In this paper we consider a family of simplicial complexes, which we call the view complexes. Our choice of objects of study is motivated by theoretical distributed computing, since the view complex is a key simplicial construction used for…

分布式、并行与集群计算 · 计算机科学 2014-12-08 Dmitry N. Kozlov

We prove that the coherent cohomology of a proper morphism of noetherian schemes can be made arbitrarily p-divisible by passage to proper covers (for a fixed prime p). Under some extra conditions, we also show that p-torsion can be killed…

代数几何 · 数学 2012-04-27 Bhargav Bhatt

In differential algebra, a proper scheme $X$ defined over an algebraically closed field $K$ with a derivation $\partial$ on it descends to the field of constants $K^\partial$ if $X$ itself lifts the derivation $\partial$. This is a result…

数论 · 数学 2017-04-20 Arnab Saha

We generalize the construction of elliptic stable envelopes to actions of connected reductive groups and give a direct inductive proof of their existence and uniqueness in a rather general situation. We show these have powerful enumerative…

代数几何 · 数学 2021-04-30 Andrei Okounkov