搜索结果：Extends

Let $X$ be a singular, projective variety. For every $p>0$, $H^{2p}(X,\mathbb{Q})$ is equipped with a mixed Hodge structure. The elements of $\mathrm{Gr}^W_{2p}H^{2p}(X,\mathbb{Q}) \cap H^{p,p} \mathrm{Gr}^W_{2p}H^{2p}(X,\mathbb{C})$ will be called Hodge (p,p)-classes. The purpose of this article, is to study the Bloch-Gillet-Soulé (BGS) cycle class map from the $p$-th operational Chow group $A^p(X)$ to the space of $(p,p)$-Hodge classes. We show that if $p=1$ and $X$ is a normal surface with at worst rational singularities, then the BGS cycle class map is surjective. This extends the Lefschetz $(1,1)$-theorem to the setup of rational surface singularities. However, the BGS map is not always surjective. For this reason we introduce extended operational Chow group $A^p_{\mathrm{ext}}(X)$ which contains the operational Chow group. We show that the BGS cycle class map extends to $A^p_{\mathrm{ext}}(X)$. Moreover, if $p=1$ and $X$ has at worst isolated singularity (not necessarily a surface), then the extended BGS map is surjective. This further extends the Lefschetz $(1,1)$-theorem to the case of isolated singularities.

Kubernetes clusters generate rich operational events during pod lifecycle transitions, yet the platform's native event retention model systematically discards the most diagnostically valuable context through multiple evidence destruction mechanisms operating on deterministic schedules. We formalize these mechanisms as an evidence horizon taxonomy: five distinct boundaries after which specific categories of diagnostic context become permanently unrecoverable from the Kubernetes API. H1(LastTerminationState rotation, ~90s) destroys container failure forensics; H2 (scheduler event pruning, 1hr/1000-event cluster limit) destroys placement rationale; H3 (ephemeral container exit, immediate) destroys debug session context; H4 (kubelet reconciliation gap) destroys in-memory operational state; and H5 (scrape-interval blind spot) renders sub-interval pod lifetimes invisible to poll-based observability tools. This paper extends the Operational Memory Architecture (OMA) to address the full evidence horizon taxonomy. Two new causal patterns are defined: P004 (Scheduler Decision Provenance) captures FailedScheduling predicate failures before kube-apiserver TTL pruning and demonstrates the first

The second law of thermodynamics constitutes a fundamental principle of physics, precluding the existence of perpetual motion machines and providing a natural definition of the arrow of time. Its scope extends across virtually all areas of physical theory. Nonetheless, certain systems are known to admit negative absolute temperatures under well-defined conditions, a phenomenon that has been experimentally observed. In this work, we formulate an extended version of the first and second laws, which recovers the conventional statement for positive temperatures and extends its applicability to the negative-temperature domain. Illustrative examples are discussed in the contexts of quantum cosmology and Onsager's vortices.

We initiate the study of total-coloring extensions, and focus our attention on planar graphs, asking: ``When can a total-$k$-coloring of some subgraph $H$ of a planar graph $G$ be extended to a total-$k$-coloring of $G$?'' We prove that if $H$ is a matching, then any total-$(Δ+3)$-coloring of $H$ in $G$ extends to $G$ provided $Δ\geq 28$; this number of colors is best-possible without introducing a distance condition on $H$. We also prove that if $H$ is a set of distance-3 cliques then any total-$(Δ+1)$-coloring of $H$ extends to $G$ provided $Δ\geq 27$; this distance condition cannot be lowered.

We present a proof system that extends action logic by omega iteration, which is viewed as infinitary multiplicative conjunction. We prove cut admissibility and establish complexity bounds for the provability predicate.

Let $C\subseteq M$ be stably embedded in a structure $\cM=(M;\dots)$. We consider {\em Fubini measures} on the subcategory $\Def(C)$ of the category $\Def(\cM)$ of definable sets in $\cM$, with ``Fubini" signaling good behaviour in definable families. We show that such a Fubini measure extends uniquely to the larger subcategory of $\Def(\cM)$ whose objects are the sets that are ``fiberable over $C$". In cases of interest ``fiberable over $C$" coincides with ``co-analyzable relative to $C$." This applies in particular to the differential field $\T$ of transseries with $C=\R$, and to differentially closed fields with constant field $C$.

For most problems pertaining to perfect matchings, one may restrict attention to matching covered graphs - that is, connected nontrivial graphs with the property that each edge belongs to some perfect matching. There is extensive literature on these graphs that are also known as 1-extendable graphs (since each edge extends to a perfect matching) including an ear decomposition theorem due to Lovász and Plummer. A cycle $C$ of a graph $G$ is conformal if $G-V(C)$ has a perfect matching; such cycles play an important role in the study of perfect matchings, especially when investigating the Pfaffian orientation problem. A matching covered graph $G$ is cycle-extendable if - for each even cycle $C$ - the cycle $C$ is conformal, or equivalently, each perfect matching of $C$ extends to a perfect matching of $G$, or equivalently, $C$ is the symmetric difference of two perfect matchings of $G$, or equivalently, $C$ extends to an ear decomposition of $G$. In the literature, these are also known as cycle-nice or as 1-cycle resonant graphs. Zhang, Wang, Yuan, Ng and Cheng, 2022, provided a characterization of claw-free cycle-extendable graphs. Guo and Zhang, 2004, and independently Zhang and Li

Polysymmetric functions, introduced by Asvin G and Andrew O'Desky as a generalization of symmetric functions, have natural connections to algebraic geometry and provide a foundation for further developments. In this paper, we study polysymmetric functions using stack partitions and develop combinatorial descriptions of several polysymmetric bases. We introduce two new signed polysymmetric bases and give explicit transition formulas among the monomial, homogeneous, elementary, power, and signed polysymmetric bases. These results extend many familiar identities from symmetric function theory to the polysymmetric setting.

Over the past few decades, combinatorial solvers have seen remarkable performance improvements, enabling their practical use in real-world applications. In some of these applications, ensuring the correctness of the solver's output is critical. However, the complexity of modern solvers makes them susceptible to bugs in their source code. In the domain of satisfiability checking (SAT), this issue has been addressed through proof logging, where the solver generates a formal proof of the correctness of its answer. For more expressive problems like MaxSAT, the optimization variant of SAT, proof logging had not seen a comparable breakthrough until recently. In this paper, we show how to achieve proof logging for state-of-the-art techniques in Branch-and-Bound MaxSAT solving. This includes certifying look-ahead methods used in such algorithms as well as advanced clausal encodings of pseudo-Boolean constraints based on so-called Multi-Valued Decision Diagrams (MDDs). We implement these ideas in MaxCDCL, the dominant branch-and-bound solver, and experimentally demonstrate that proof logging is feasible with limited overhead, while proof checking remains a challenge.

The central challenge for AI agents is not only performance but accountability. Agents that act through opaque prompt sequences may produce correct outputs, but they provide little basis for verifying why an action was permitted, where an error occurred, or how responsibility should be assigned. This paper presents the Structured Cognitive Loop as an architecture for accountable behavior in large language model agents. SCL separates cognition, memory, control, and action into distinct modules. The language model proposes. External memory preserves verified state. A lightweight controller checks preconditions, prevents redundant actions, and authorizes execution before tools are used. We evaluate SCL against ReAct and common LangChain agent variants across travel planning, conditional email drafting, and constraint guided image generation. Across 360 episodes, SCL achieves 86.3 percent task success compared with 70.5 to 76.8 percent for prompt based baselines. It also improves goal fidelity, reduces redundant tool calls, increases reuse of intermediate state, and lowers unsupported assertions. This extended revision situates SCL within a broader architecture of epistemic accountabil

Many well-known logical identities are naturally written as equivalences between contextual formulas. A simple example is the Boole-Shannon expansion $c[p] \equiv (p \wedge c[\mathrm{true}] ) \vee ( eg\, p \wedge c[\mathrm{false}] )$, where $c$ denotes an arbitrary formula with possibly multiple occurrences of a "hole", called a context, and $c[\varphi]$ denotes the result of "filling" all holes of $c$ with the formula $\varphi$. Another example is the unfolding rule $μX. c[X] \equiv c[μX. c[X]]$ of the modal $μ$-calculus. We consider the modal $μ$-calculus as overarching temporal logic and, as usual, reduce the problem whether $\varphi_1 \equiv \varphi_2$ holds for contextual formulas $\varphi_1, \varphi_2$ to the problem whether $\varphi_1 \leftrightarrow \varphi_2$ is valid . We show that the problem whether a contextual formula of the $μ$-calculus is valid for all contexts can be reduced to validity of ordinary formulas. Our first result constructs a canonical context such that a formula is valid for all contexts if{}f it is valid for this particular one. However, the ordinary formula is exponential in the nesting-depth of the context variables. In a second result we solve this

Social media platforms have diverse content moderation policies, with many prominent actors hesitant to impose strict regulations. A key reason for this reluctance could be the competitive advantage that comes with lax regulation. A popular platform that starts enforcing content moderation rules may fear that it could lose users to less-regulated alternative platforms. Moreover, if users continue harmful activities on other platforms, regulation ends up being futile. This article examines the competitive aspect of content moderation by considering the motivations of all involved players (platformer, news source, and social media users), identifying the regulation policies sustained in equilibrium, and evaluating the information quality available on each platform. Applied to simple yet relevant social networks such as stochastic block models, our model reveals the conditions for a popular platform to enforce strict regulation without losing users. Effectiveness of regulation depends on the diffusive property of news posts, friend interaction qualities in social media, the sizes and cohesiveness of communities, and how much sympathizers appreciate surprising news from influencers.

We prove the existence of finite groups of orientation-preserving homeomorphisms of some closed orientable surface $S$ that act freely and which extends as a group of homeomorphisms of some compact orientable $3$-manifold with boundary $S$, but which cannot extend to a handlebody.

We define a metric in the space of positive finite positive measures that extends the 2-Wasserstein metric, i.e. its restriction to the set of probability measures is the 2-Wasserstein metric. We prove a dual and a dynamic formulation and extend the gradient flow machinery of the Wasserstein space. In addition, we relate the barycenter in this space to the barycenter in the Wasserstein space of the normalized measures.

Recently it is shown that the non-relativistic quantum formulations can be derived from a least observability principle [36]. In this paper, we apply the principle to massive scalar fields, and derive the Schrödinger equation of the wave functional for the scalar fields. The principle extends the least action principle in classical field theory by factoring in two assumptions. First, the Planck constant defines the minimal amount of action a field needs to exhibit in order to be observable. Second, there are constant random field fluctuations. A novel method is introduced to define the information metrics to measure additional observable information due to the field fluctuations, \added{which is then converted to the additional action through the first assumption.} Applying the variation principle to minimize the total actions allows us to elegantly derive the transition probability of field fluctuations, the uncertainty relation, and the Schrödinger equation of the wave functional. Furthermore, by defining the information metrics for field fluctuations using general definitions of relative entropy, we obtain a generalized Schrödinger equation of the wave functional that depends on

In $\C^2=\R^2+i\R^2$ with coordinates $z=(z_1,z_2), z=x+iy$, we consider a function $f$ continuous on a domain $Ω$ of $\R^2$ separately real analytic in $x_1$ and CR extendible to $y_2$ (resp. CR extendible to $y_2>0$). This means that $f(\cdot,x_2)$ extends holomorphically for $|y_1|<ε_{x_2}$ and $f(x_1,\cdot)$ for $| y_2|<ε$ (resp. $0\leq y_2<ε$ continuous up to $y_2=0$) with $ε$ independent of $x_1$. We prove in Theorem 3.4 that $f$ is then real analytic (resp. in Theorem 3.5 that it extends holomorphically to a "wedge" $W= Ω+iΓ_ε$ where $Γ_ε$ is an open cone trumcated by $|y|<ε$ and containing the ray $0<y_2<ε)$.

Geometric representations provide a principled framework for structuring the description of latent constructs and clarifying sources of uncertainty in their dimensional characterisation. We introduce a novel geometric representation of factor models via two subspaces spanned by paired matrices, where determinantal expressions explicitly quantify the contributions of different dimension subsets to the factor structure. This formulation refines rank-based conditions relevant to understanding factor score indeterminacy and the implications of non-uniqueness in instrumental variable estimation for over-identified models. By weighting these multidimensional contributions to encode sensitivity to their variation, we extend the definition of tetrads into an algebraic procedure that establishes conditions for identifying variability components attributable to individual dimensions. Focusing on cases where one factor encodes structural information, we derive minimal conditions-expressed through graph planarity-that ensure such dimension-specific identifiability. The proofs yield both formal verification tools and constructive methods for generating counterexamples where these conditions fai