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

Breaking of equivalence between the microcanonical ensemble and the canonical ensemble, describing a large system subject to hard and soft constraints, respectively, was recently shown to occur in large random graphs. Hard constraints must…

It is well-known that in finite graphs, large complete minors/topological minors can be forced by assuming a large average degree. Our aim is to extend this fact to infinite graphs. For this, we generalise the notion of the relative end…

In this paper the relative recognition principle will be proved. It states that a pair of spaces $(X_o,X_c)$ is weakly equivalent to $(\Omega^N_\text{rel}(\iota:B\hookrightarrow Y),\Omega^N(Y))$ if and only if $(X_o,X_c)$ are grouplike…

Weakly separated collections arise in the cluster algebra derived from the Pl\"ucker coordinates on the nonnegative Grassmannian. Oh, Postnikov, and Speyer studied weakly separated collections over a general Grassmann necklace $\mathcal{I}$…

A classical counterexample due to E. De Giorgi, shows that the weak maximum principle does not remain true for general linear elliptic differential systems. After that, there are some efforts to establish the weak maximum principle for…

A theorem by Ding, Oporowski, Oxley, and Vertigan states that every sufficiently large bipartite graph without twins contains a matching, co-matching, or half-graph of any given size as an induced subgraph. We prove that this Ramsey…

The founding of the theory of cylindric algebras, by Alfred Tarski, was a conscious effort to create algebras out of first order predicate calculus. Let $n\in\omega$. The classes of non-commutative cylindric algebras ($NCA_n$) and weakened…

A graph class admits an implicit representation if, for every positive integer $n$, its $n$-vertex graphs have a $O(\log n)$-bit (adjacency) labeling scheme, i.e., their vertices can be labeled by binary strings of length $O(\log n)$ such…

For $n<\omega$, we say that the $\Pi^1_n$-reflection principle holds at $\kappa$ and write $\text{Refl}_n(\kappa)$ if and only if $\kappa$ is a $\Pi^1_n$-indescribable cardinal and every $\Pi^1_n$-indescribable subset of $\kappa$ has a…

Consider a graph $G = (V, E)$ and a function $f: V \rightarrow \{0, 1, 2\}$. A vertex $u$ with $f(u)=0$ is defined as \emph{undefended} by $f$ if it lacks adjacency to any vertex with a positive $f$-value. The function $f$ is said to be a…

A (weak chord) index is a function on the crossings of knot diagrams such that: 1) the index of a crossing does not change under Reidemeister moves; 2) crossings which can be paired by a second Reidemeister move have the same index. We show…

The present work analyzes the meaning of the Weak Equivalence Principle in the context of quantum mechanics. A quantal definition for this principle is introduced. This definition does not require the concept of trajectory and relies upon…

In functional analysis it is well known that every linear functional defined on the dual of a locally convex vector space which is continuous for the weak topology is the evaluation at a uniquely determined point of the given vector space.…

A graph $G$ has the \emph{strong parity property} if for every subset $X\subseteq V$ with $|X|$ even, $G$ has a spanning subgraph $F$ with minimum degree at least one such that $d_F(v)\equiv 1\pmod 2$ for all $v\in X$, $d_F(y)\equiv 0\pmod…

In a seminal work, B. Simon provided a classification of nonnegative Schr\"odinger operators $-\Delta+V$ into subcritical and critical operators based on the long-term behaviour of the associated heat kernel. Later works by others developed…

The aim of this article is to refine a weak invariance principle for stationary sequences given by Doukhan & Louhichi (1999). Since our conditions are not causal our assumptions need to be stronger than the mixing and causal $\theta$-weak…

The main object of this paper is to study the concept of weak $I^K$-convergence, a generalization of weak $I^*$-convergence of sequences in a normed space, introducing the idea of weak* $I^K$-convergence of sequences of functionals where…

The uncertainty principle states that a signal cannot be localized both in time and frequency. With the aim of extending this result to signals on graphs, Agaskar&Lu introduce notions of graph and spectral spreads. They show that a graph…

Katona and Varga showed that for any rational number $t \in (1/2,1]$, no chordal graph is minimally $t$-tough, while Katona and Khan characterized all minimally $t$-tough, chordal graphs with $t \le 1/2$. We conjecture that no chordal graph…

This paper defines and discusses the dimension notion of topological slow entropy of any subset for Z^d actions. Also, the notion of measure-theoretic slow entropy for Z^d actions is presented, which is modified from Brin and Katok [2].…