相关论文: Weak Vop\v{e}nka's Principle does not imply Vop\v{…

One way of suggesting that an NP problem may not be NP-complete is to show that it is in the class UP. We suggest an analogous new approach---weaker in strength of evidence but more broadly applicable---to suggesting that concrete~NP…

A partial ordering P is said to have the weak Freese-Nation property (WFN) if there is a mapping f:P ---> [P]^{<= aleph_0} such that, for any a, b in P, if a <= b then there exists c in f(a) cap f(b) such that a <= c <= b. In this note, we…

In this paper we show that if $(y_n)$ is a seminormalized sequence in a Banach space which does not have any weakly convergent subsequence, then it contains a wide-$(s)$ subsequence $(x_n)$ which admits an equivalent convex basic sequence.…

In this paper, we introduce the concepts of m-quasiconvex, originally m-quasiconvex,and generalized m-quasiconvex functionals on topological vector spaces. Then we extend the concept of point separable topological vector spaces (by the…

Weak and strong coloring numbers are generalizations of the degeneracy of a graph, where for each natural number $k$, we seek a vertex ordering such every vertex can (weakly respectively strongly) reach in $k$ steps only few vertices with…

The concept of graph powers has been extensively studied in graph theory. Analogous to graph powers, Chandran et al. [3] introduced the notion of bipartite powers for bipartite graphs. In this paper, we show that the class of interval…

A graph $G$ is well-covered if every minimal vertex cover of $G$ is minimum, and a graph $G$ is well-dominated if every minimal dominating set of $G$ is minimum. Studies on well-covered graphs were initiated in [Plummer, JCT 1970], and…

It is shown that $u_k \cdot v_k$ converges weakly to $u\cdot v$ if $u_k\weakto u$ weakly in $L^p$ and $v_k\weakly v$ weakly in $L^q$ with $p, q\in (1,\infty)$, $1/p+1/q=1$, under the additional assumptions that the sequences $\Div u_k$ and…

The proofs of K. Oka's Coherence Theorems are based on Weierstrass' Preparation (division) Theorem. Here we formulate and prove a Weak Coherence Theorem without using Weierstrass' Preparation Theorem, but only with power series expansions:…

The notion of a weakly Mal'tsev category, as it was introduced in 2008 by the third author, is a generalization of the classical notion of a Mal'tsev category. It is well-known that a variety of universal algebras is a Mal'tsev category if…

We prove a duality relation and an integration by parts formula for fractional operators with a general analytical kernel. Based on these basic results, we are able to prove a new Gronwall's inequality and continuity and differentiability…

In this paper, we prove first that the iterates of a mean nonexpansive map defined on a weakly compact, convex set converge weakly to a fixed point in the presence of Opial's property and asymptotic regularity at a point. Next, we prove the…

Among cocomplete categories, the locally presentable ones can be defined as those with a strong generator consisting of presentable objects. Assuming Vop{\v{e}}nka's Principle, we prove that a cocomplete category is locally presentable iff…

In dealing with asymptotic approximation of possibly divergent nets of probability distributions, we are led to study uniform structures on the set of distributions. This paper identifies a class of such uniform structures that may be…

An oriented graph has weak diameter at most $d$ if every non-adjacent pair of vertices are connected by a directed $d$-path. The function $f_d(n)$ denotes the minimum number of arcs in an oriented graph on $n$ vertices having weak diameter…

Nine variations of the concept of domination in a simple graph are identified as fundamental domination concepts, and a unified approach is introduced for studying them. For each variation, the minimum cardinality of a subset of dominating…

We consider four categories: the category of diagrams of small categories indexed by a given small category O, the (comma) category of small categories over O, the category of diagrams of simplicial sets indexed by O, and the category of…

Graphons are analytic objects representing limits of convergent sequences of graphs. Lov\'asz and Szegedy conjectured that every finitely forcible graphon, i.e. any graphon determined by finitely many graph densities, has a simple…

The celebrated dependent random choice lemma states that in a bipartite graph an average vertex (weighted by its degree) has the property that almost all small subsets $S$ in its neighborhood has common neighborhood almost as large as in…

In this paper, we introduce the concepts of weaknorm, quasi-weaknorm on real vector spaces. By these concepts, we introduce the concept of quasi-locally convex topological vector spaces, which include locally convex topological vector…