惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

J
Java Code Geeks
F
Fortinet All Blogs
云风的 BLOG
云风的 BLOG
MyScale Blog
MyScale Blog
D
DataBreaches.Net
Stack Overflow Blog
Stack Overflow Blog
A
About on SuperTechFans
Google DeepMind News
Google DeepMind News
Microsoft Security Blog
Microsoft Security Blog
腾讯CDC
The GitHub Blog
The GitHub Blog
Jina AI
Jina AI
B
Blog RSS Feed
I
InfoQ
N
Netflix TechBlog - Medium
T
The Blog of Author Tim Ferriss
Microsoft Azure Blog
Microsoft Azure Blog
Recent Announcements
Recent Announcements
GbyAI
GbyAI
H
Help Net Security
L
LangChain Blog
M
MIT News - Artificial intelligence
Y
Y Combinator Blog
aimingoo的专栏
aimingoo的专栏

math.CO updates on arXiv.org

Complement Submodular Information Measures for Balanced and Robust Data Selection A Proof of a Conjecture on Positive and Negative Square Energies of Unicyclic Graphs Laplacian Spectrum of the Weakly Zero-Divisor Graph of a Finite Commutative Ring An identity for second Eulerian numbers via lattice-point counting $t$-tone edge coloring of graphs Constructing Maximal Bumpless Pipedreams for Double Grothendieck Polynomials Mubayi's Polynomial-Ideal Conjecture and Cover-Ideal Turán Methods Implicit Binarization via Complex Phase Dynamics in Combinatorial Optimization The limits of Schur multipliers in Pólya conversion problems for the $q$-permanent function Universality theorems for generalized splines Framing Triangulations for Arbitrary Integer Flow Polytopes On the Common Generalization of Gentle Algebras and Framed Directed Acyclic Graphs The complexity of frugal digraph homomorphisms Chaotic and periodic behavior of jeu de taquin on infinite Young tableaux Enumerating Pattern Avoiding Parking Functions Incidence toric ideals and three-point functions Unique Winning Opening Move in Three-Row Chomp Strong majority colorings of graphs A Balancing Theorem for Spanning Trees of Rectangular Grid Graphs Spectral radius and edge-disjoint connected factors of graphs New invariants for rank metric codes, with applications to the classification of rank two semifields of order 256 Flexible DP-4-coloring of planar graphs without 4-cycles and intersecting triangles Balanced intersection size distributions in projective planes List Reconstruction Problem with List Size Two Is Dimensionality a Barrier for Retrieval Models? The INIEP: Irreducible and Positive Realizations The number of Pfaffian orientations on punctured polygonally cellulated surfaces Explicit Construction of Polytopes whose Ehrhart Polynomials Realize any Given Sign Pattern Finite-state enumeration of adjacency-constrained 132-avoiding permutations AMDS and quantum AMDS Constacyclic codes of length $4p^ς$ over $\mathbb{F}_{{p}^{m}}$
Inhomogeneous random 2-SAT
Jan Hladký, Petr Savický · 2025-10-20 · via math.CO updates on arXiv.org

We introduce an inhomogeneous variant of random 2-SAT. Each variable $v_1,\ldots,v_n$ is assigned a type from a state space $Λ$, independently at random. Clause inclusion is governed by a symmetric measurable kernel $W$ on $(Λ\times \{+,-\})^2$, in analogy with the inhomogeneous random graph model of Bollobás, Janson, and Riordan: given literals $\ell_i\in\{v_i,\neg v_i\}$ and $\ell_j\in\{v_j,\neg v_j\}$, the clause $\{\ell_i,\ell_j\}$ appears with probability $W(\mathrm{type}(\ell_i),\mathrm{type}(\ell_j))/(2n)$. In particular, for a variable $v_i$ of type $x\inΛ$, the slices $W((+,x),\cdot)$ and $W((-,x),\cdot)$ describe how $v_i$ and $\neg v_i$ interact with other literals. We identify a parameter $ρ^*(W)$, defined as the spectral radius of an integral operator derived from $W$, and show that $ρ^*(W)<1$ and $ρ^*(W)>1$ correspond to asymptotically almost surely satisfiable and unsatisfiable instances, respectively. The satisfiability threshold for homogeneous random 2-SAT is well-established, occurring when the ratio of clauses to variables is $1$. This corresponds to a weight function of $W \equiv 1$ and a clause density of $1/(2n)$. Our result extends this classical result to a broad class of models controlled by types of variables.