跳到正文
研踪PaperTrail

论文库

检索计算机领域论文,按研究方向、作者或关键词筛选。

部分采集异常
正在读取账号与研究记录…

全站更新概况

+1112新增论文
+875其中 AI 相关
+133已有论文修订
+97新增 AI 导读

arXiv 最近完成扫描:2026-11-20 04:39 · 全站最近入库:2026-11-19 19:09各信源进度 →

统计口径与数据新鲜度

统计 2026-11-19 05:01 — 2026-11-20 05:01(北京时间) · 点击数字查看对应简报;AI 相关包含在新增论文内。

最近完成检查:2026-11-20 04:39最近发现新增版本:2026-11-19 19:09库内论文最新更新时间:2026-11-19 02:59

每分钟刷新已保存的数据。空检查不代表采集异常;新收录可能包含历史论文。AI 导读按新增版本计数。

27,982 已收录论文23,249 AI 相关8,559 有修订112 HF 社区发现

浏览论文库

时间范围跟随排序:版本更新、本站收录或首次发表。最新收录可能包含历史论文。部分信源异常,查看状态 →

找到 259 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-20 04:38(北京时间)
新论文 · v1arXiv:2611.24832

小树性图的列表打包

List packing for graphs with small arboricity

Stijn Cambie, Wouter Cames van Batenburg, Xuding Zhu

AI 速读 基于摘要

作者证明边集可分解为 r 个森林的图的列表打包数至多 2^r,并由此改进无三角形平面图等图类的列表打包上界。

math.CO · cs.DM

查看原文摘要

We prove that every graph $G$ whose edge set is the union of $r$ forests has list packing number at most $2^r$. This means that for all $k\ge 2^r$ and every list-assignment $L$ with lists of size $k$, the graph $G$ admits $k$ disjoint proper $L$-colourings. While for large $r$ this bound is far from optimal, for $r\in\{1,2\}$ it is sharp. As a direct corollary of the case $r=2$, we obtain that every triangle-free planar graph has list packing number at most $4$, thus improving upon a result of Dvořák, Masařík, Musílek and Pangrác and providing the optimal answer to a question of Dvořák, Postle and Norin on (weighted) $ε$-flexibility of such graphs. As a corollary of the case $r=3$, we obtain a short alternative proof that every $K_5$-minor-free (and hence every planar) graph has list-packing number at most $8$, matching the state of the art. All results above also hold for the stronger notion of correspondence packing.

新论文 · v1arXiv:2611.24544

Treewidth 3 in the Product Structure Theorem for Bounded Degree Graphs in Minor-Closed Classes

Vida Dujmović, Robert Hickingbotham, Pat Morin, David R. Wood

原文摘要

We show that, for all positive integers $t$ and $Δ$, there exists an integer $c$ such that, for every $K_t$-minor-free graph $G$ with maximum degree at most $Δ$, there exists a graph $H$ of treewidth at most $3$ and a path $P$ such that $G$ is isomorphic to a subgraph of the strong product $H\boxtimes P\boxtimes K_c$. This improves on a previous result of Dujumović, Esperet, Micek, Walczak, and Wood (2022) by bounding the treewidth of $H$ independently of $t$ and $Δ$. As an immediate consequence we obtain a bound of $O(r^4)$ on the $r$-weak colouring number of bounded-degree graphs from any proper minor-closed graph class.

math.CO · cs.DM

新论文 · v1arXiv:2611.24504

A combinatorial proof of a symmetric joint distribution on strict binary trees

Shishuo Fu

原文摘要

Nonplanar strict binary trees on $2n+1$ vertices are enumerated by the reduced tangent numbers $T_{2n+1}/2^n$, whose entries are refined by Poupard's triangle. Poupard defined the end of the minimal chain ($\mathrm{eoc}$) and the parent of the maximum leaf ($\mathrm{pom}$) on these trees, proving that $\mathrm{eoc}$ and $\mathrm{pom}+1$ share this triangular distribution. Foata and Han subsequently showed via tree calculus and partial difference equations that the joint distribution of $(\mathrm{eoc}, 2n+1-\mathrm{pom})$ is symmetric. By introducing an auxiliary tree statistic dual to $\mathrm{eoc}$, we give a bijective proof of this symmetry. Our proof composes a recursive bijection on strict binary trees, a bijection to alternating André permutations, and the reverse-complement involution on permutations.

math.CO · cs.DM

新论文 · v1arXiv:2611.24441

An additive-square-free word over an alphabet of size 6

Jeffrey Shallit

原文摘要

An additive square over $\mathbb{N}$ is two consecutive nonempty blocks of the same length and same sum. For example, 1423 is an additive square, since 14 and 23 both have length 2 and sum 5. Solving a problem that has been open for more than 50 years, we give an example of an infinite word over a 6-letter subset of N that avoids additive squares.

math.CO · cs.DM

版本更新 · v2arXiv:2609.18318

$p$-ary (Non Weakly) Regular Bent Functions in Generalized $\cPS$ class

Alexander Kholosha, Mohit Pal

原文摘要

We use $m$-dimensional partial spreads of $\fp^{2n}$, where $p$ is an odd prime, $n$ is a positive integer and $m$ divides $n$, to construct two classes of bent functions from $\fp^{2n}$ to $\fp$. Our construction generalizes the classes of $p$-ary $\cPS^{-}$ and $\cPS^{+}$ regular bent functions proposed by P. Lison\v ek and H. Y. Lu (Des. Codes Cryptogr. 73 (2014), 209--216). Unlike the original class, such bent functions can be either regular or non weakly regular.

cs.IT · cs.DM

版本更新 · v2arXiv:2604.15386

On Word Representations and Embeddings in Complex Matrices

Paul C. Bell, George Kenison, Reino Niskanen, Igor Potapov, Pavel Semukhin

原文摘要

Embeddings of word structures into matrix semigroups provide a natural bridge between combinatorics on words and linear algebra. However, low-dimensional matrix semigroups impose strong structural restrictions on possible embeddings. Certain finitely generated groups admit faithful representations in SL(2, C) and other similar matrix groups. On the other hand, it is known that the product of two free semigroups on two generators cannot be embedded into the 2x2 complex matrices. In this paper we study embeddings of word structures into low-dimensional matrix semigroups over the complex numbers and develop new techniques for constructing word representations of the Euclidean Bianchi groups. These representations provide a symbolic framework and a natural first step towards analysing fundamental decision problems in 2x2 matrix semigroups.

cs.FL · cs.DM · math.GR · math.RT

版本更新 · v2arXiv:2609.24804

FPT Isomorphism Test for $F$-Free Tournaments

Daniel Neuen

原文摘要

We show that isomorphism of $F$-free tournaments can be solved in FPT time $f(k) \cdot n^{O(1)}$, where $k$ denotes the size of $F$, and $n$ denotes the size of the input tournaments. Our result extends on a previous FPT isomorphism test for tournaments of bounded twin-width [Grohe, Neuen 2024], as well as XP isomorphism tests parameterized by the VC dimension or the chromatic number [Raßmann, Schweitzer 2026]. It also implies that every non-trivial hereditary class of tournaments admits a polynomial-time isomorphism test. Our algorithm builds on a combination of spectral, geometric, combinatorial and group-theoretic tools.

cs.DS · cs.DM

新论文 · v1arXiv:2611.24236

From a finite subgroup of $SO(3)$:$C_2$ leads to a Holant dichotomy

Yuxuan Zhou

原文摘要

Counting complexity within the Holant framework has been extensively studied through complexity dichotomy theorems. While substantial progress has been achieved for various restricted settings, the general complex-valued even-arity case without auxiliary unary signatures remains largely open. This paper studies a fundamental case in this program where the binary signatures induce a group structure satisfying \(M(B(\mathcal{F}))\cong C_2\). It is observed that projective equivalence classes of binary signature matrices naturally embed into finite subgroups of \(SO(3)\), providing an algebraic viewpoint for structural classification. This paper further identifies two fundamentally different regimes for the \(C_2\) case, namely the normal and isotropic cases, and analyzes their complexity behavior separately. Combining gadget constructions, decomposition techniques, interpolation arguments, and a realnumberization approach that transforms the complex-valued setting into an equivalent real-structured framework, this paper establishes a complete dichotomy theorem: for every even-arity signature set \(\mathcal{F}\) satisfying \(M(\B(\mathcal{F}))\cong C_2\), the problem \(\mathrm{Holant}(\mathcal{F})\) is either polynomial-time computable or \#P-hard. A Pauli-basis representation for signatures is further introduced as an algebraically natural language for organizing realizable signatures and revealing structural relations that are less transparent in the standard basis.

cs.CC · cs.CL · cs.DM

新论文 · v1arXiv:2611.24201

A (12/11+eps)-Approximation for Nonpreemptive Throughput Maximization

Mikhail Cherniavskii, Mikhail Koshelev, Andrey Kupavskii, Stanislav Moiseev, Fedor Ozhegov, Alexander Shekhovtsov

原文摘要

We study unweighted nonpreemptive throughput maximization on an arbitrary number of identical machines: each job has a processing time and a release--deadline window, and the goal is to schedule as many jobs as possible. For every fixed $\varepsilon>0$, we give a randomized $(12/11+\varepsilon)$-approximation. This improves the recent $(4/3+\varepsilon)$-approximation of Alexander Armbruster, Fabrizio Grandoni, Antoine Tinguely, and Andreas Wiese and the $(17/13+\varepsilon)$-approximation of Tong and Xu. For binary-encoded integral inputs, our algorithm runs in time $n^{O_\varepsilon(1)}\operatorname{poly}(N)$, where $N$ is the input length.

cs.DS · cs.DM

版本更新 · v2arXiv:2611.20344

Up or down at every integer: Collatz-type maps of arbitrary sets and the up-down graph

Oleg Vasilyev

原文摘要

For a set $S$ of positive integers let $T_S$ send $x$ to $\lceil 3x/2\rceil$ if $x\in S$ and to $\lceil x/2\rceil$ otherwise. The odd numbers give the Collatz map, the even numbers give it again after a shift by one, and $S=\mathbb{N}$ gives Mahler's map $x\mapsto\lceil 3x/2\rceil$. All these maps are subgraphs of the up-down graph $G$, in which every $x$ has the edges $x\to\lceil x/2\rceil$ and $x\to\lceil 3x/2\rceil$, and so are the families of maps in which the direction is forced at some numbers and free at the others. The cycles of the maps are the simple cycles of the subgraph, their divergent orbits are its rays, and all maps of a family are bounded exactly when the subgraph has no ray. We classify the simplest sets and show that density says little: some sets of density one send every orbit to 1, and some periodic sets of arbitrarily small density have increasing orbits. Every positive integer is the least element of a cycle of some map. The critical proportion of steps up is $\log_3 2$: cycles stay below it, divergent orbits stay above it, and both come arbitrarily close. For sets periodic modulo a power of 2, an effective up-frequency from a finite Markov chain takes the place of the density, and a finite computation can prove that every orbit reaches a cycle. Mahler's Z-number problem is implied by a question about one such map. Finally, we ask how far the Collatz map is from maps whose behaviour can be proved. Finite changes never help. Adding fewer than $\log_{3/2}N+1$ even numbers below $N$ makes an orbit increase, while removing the odd numbers congruent to 9 or 15 modulo 16, an eighth of all integers, gives a map all of whose orbits provably reach the cycle (1,2); removing 22 residue classes modulo 512, a proportion 0.043, also suffices.

cs.DM · math.DS · math.NT

版本更新 · v3arXiv:2604.22584

Increasing arc-connectivity by bounded- and fixed-size inversions

Florian Hörsch, Lucas Picasarri-Arrieta

原文摘要

For a digraph $D$ and some $X \subseteq V(D)$, the inversion of $X$ is the operation of flipping all arcs both of whose endvertices are in $X$. We initiate the study of establishing arc-connectivity properties by applying inversions of bounded or fixed size. For fixed-size inversions, the feasibility problem is interesting. For all integers $p \geq 2$ and $k \geq 1$, we give a characterization of the digraphs that can be made $k$-arc-strong by applying inversions of size exactly $p$, provided they are sufficiently large. For bounded-size inversions, the feasibility problem is easy, so we focus on minimising the number of inversions. We prove that for all integers $p\geq 3$ and $k \geq 1$ and any $ε>0$, there exists a polynomial-time $(4k-2+ε)$-approximation algorithm for computing the minimum number of inversions of size at most $p$ that make a given digraph $k$-arc-strong. This is in stark contrast to other results on inversion optimization problems. On the other hand, we show that for any $p\geq 3$ and $k \geq 1$ the problem is NP-hard, and, moreover, APX-hard. As a result on parameterized complexity, we show that for any $k \geq 2$, it is $W[1]$-hard with respect to $p$ to decide whether a given digraph can be made $k$-arc-strong by applying a single inversion of size at most $p$. We also prove that for a given multidigraph, it is $W[1]$-hard with respect to $\ell$ to decide whether it can be made 2-arc-strong by applying $\ell$ inversions of size 2.

math.CO · cs.DM

新论文 · v1arXiv:2611.23624

Matroid Connectedness and Component Decomposition: Breaking the Quadratic Barrier

Manuel Aprile, Roberto Ronco

原文摘要

Deciding whether a matroid is connected and computing its connected components are two fundamental algorithmic problems in matroid theory. Since the 1970s, the best known algorithms for both problems have used $O(n^2)$ independence queries on an $n$-element ground set. Our main contribution is to break this quadratic barrier: we give a deterministic algorithm that computes all connected components of a matroid on $n$ elements with $O(n \log{n})$ independence queries. Our algorithm for component decomposition combines fundamental basis exchanges with a disjoint-set union data structure, avoiding the explicit construction of the fundamental graph. Moreover, we show that our algorithm is asymptotically optimal by giving a lower bound based on a simple information-theoretic argument: any (deterministic or bounded-error randomized) algorithm to compute connected components needs $Ω(n \log{n})$ independence queries. Then, we turn to the query complexity of deciding whether a matroid is connected. For this problem, we present an algorithm that uses $O(nh)$ independence queries, where $h \ge 1$ bounds the size of any chain of nonempty proper cyclic flats. The algorithm achieves asymptotically optimal linear query complexity on elementary split matroids, that include all paving matroids, and on arbitrary direct sums of uniform matroids.

cs.DM

新论文 · v1arXiv:2611.23576

Proper thinness at most 2: threshold and trivially perfect graphs

Barbara Rivero, Eric Brandwein, Flavia Bonomo-Braberman

原文摘要

The proper thinness of a graph is a parameter that generalizes proper interval graphs: the graphs of proper thinness 1 are exactly the proper interval graphs. The complexity of computing it is open even for cographs. In this paper we study it on two subclasses of cographs: threshold graphs and trivially perfect graphs. For threshold graphs, we show that the proper thinness is 1 if the graph is claw-free and 2 otherwise. For trivially perfect graphs, we characterize those of proper thinness at most 2 in three ways: structurally, through two properties of strongly consistent solutions that we call staggered and boundary; algorithmically, with a linear-time algorithm that decides whether the proper thinness is at most 2; and by forbidden induced subgraphs, showing that the $\mathrm{claw}_2$ and the lotus are exactly the minimal obstructions.

cs.DM

版本更新 · v2arXiv:2610.39870

最优自正交二元线性码

Optimal self-orthogonal binary linear codes

Sascha Kurz

AI 速读 基于摘要

作者完成了八维二元自正交码在给定最小距离下最小可能长度的确定,并给出九维情形在最小距离不超过64时的精确值与界。

math.CO · cs.DM · cs.IT

查看原文摘要

We complete the determination of the minimum possible length of eight-dimensional binary self-orthogonal codes with given minimum distance. For dimension nine we give exact values and bounds for minimum distance at most $64$. By exploiting the geometric reformulation of linear codes as multisets of points, we fully redo the classification for dimension at most seven in a simplified and computer-free manner. As a by-product we prove the non-existence of $[93,9,44]_2$ codes and show several divisibility results for putative optimal nine-dimensional binary codes.

版本更新 · v3arXiv:2604.17509

Rado's covering problem for cubes and balls: a survey

Gian Maria Dall'Ara, Adrian Dumitrescu

原文摘要

What is the largest constant $c\in [0,1]$ with the property that every finite collection $\mathcal{C}$ of axis-parallel squares in the plane admits a disjoint sub-collection $\mathcal{S}$ occupying at least a fraction $c$ of the area covered by $\mathcal{C}$? This problem was first raised by T.~Radó in 1928, who was motivated by a classical covering lemma in real analysis due to Vitali. R.~Rado later generalized the problem from axis-parallel squares in the plane to homothetic copies of any given convex body $K$ in $\mathbb{R}^d$, where now we are looking for an optimal constant $F(K)$. In this paper we survey the literature on this problem, with a focus on the case where $K$ is a cube or a ball in the high-dimensional regime $d\rightarrow \infty$. The estimates that we currently have for cubes are much more precise than those for balls: namely if $Q^d$ is a $d$-dimensional cube, then \[ (e^{-1}+o(1))\frac{2^{-d}}{d \log{d}} \leq F(Q^d)\leq 2^{-d}, \] while denoting $B^d$ a $d$-dimensional Euclidean ball, then \[ 2.910^{-d} \leq F(B^d) \leq 2.447^{-d}.\] Except for the upper bound for cubes, which is classical, the other estimates are due to the authors.

math.MG · cs.DM · math.CA · math.CO

新论文 · v1arXiv:2611.22780

Heap-type permutation generation with a prescribed final arrangement

Luís M. S. Russo

原文摘要

Heap's algorithm generates all permutations of an array of n items, obtaining each one from its predecessor by a single swap. We determine the net permutation applied to the array by every complete recursive call: a transposition when the number of items is odd and at least three, and a cycle through all items when it is even. We show that the output of each call is a concatenation of right cosets of the symmetric group on one item fewer, and we prove a general formula: the order in which the items are parked at the last position may be chosen freely, every such order corresponds to exactly one valid schedule, and it determines the net permutation of the call. Two variants follow. In the cyclic variant a complete sweep over an even number of items rotates the array by one position. In the extremal variant, for even n, a sweep started from the identity ends in the lexicographically largest arrangement that any single-swap enumeration can leave; by a parity argument this is the reversal exactly when n is congruent to 2 modulo 4. The construction of the extremal variant is proved correct when n is divisible by 4 and verified by computer for all even n up to 10000.

math.CO · cs.DM · cs.DS

新论文 · v1arXiv:2611.22760

Sharp lower bounds for weighted bisections of graphs with bounded maximum degree

Stefanie Gerke, Gregory Gutin, Anders Yeo, Yacong Zhou

原文摘要

A bisection of a graph is a partition of its vertex set into two parts the sizes of which differ by at most one. We prove that every finite simple graph of maximum degree at most an odd positive integer $k$, with arbitrary nonnegative real edge weights, has a bisection of weight at least $(k+1)/(2k)$ times its total edge weight. The corresponding bound $(k+2)/(2(k+1))$ for even $k$ follows immediately. Both coefficients are best possible. Somewhat surprisingly, these are exactly the sharp coefficients known for maximum weighted cuts, despite the additional balance requirement.

math.CO · cs.DM

新论文 · v1arXiv:2611.22552

On (Pathwidth, Clique)-boundedness

Amir Nikabadi

原文摘要

We prove that every $(\pw,ω)$-bounded class of graphs has bounded tree-independence number, answering a question of Bešter Štorgel, Dallard, Lozin, Milanič, and Zamaraev. We deduce this from a bound on the tree-independence number of graphs with neither $\B_ρ$ nor $K_{σ,σ}$ as an induced minor, where $\B_ρ$ is the complete binary tree of height $ρ$ and the bound depends only on $ρ$ and $σ$. We then obtain an asymptotically sharp bound on the path-independence number of $n$-vertex graphs in any $(\pw,ω)$-bounded class. The lower-bound examples also give counterexamples to a conjecture of Hickingbotham and Joret. We further prove that, for every forest $F$ and every $\ell\in\N$, there is a constant $k=k(F,\ell)\in\N$ such that every graph $G$ with no induced theta or $\ell$-long prism and no induced subgraph isomorphic to $F$ satisfies tree-independence number at most $k$. This proves a strengthened form of a conjecture of Chudnovsky, Hajebi, and Trotignon. Finally, for every integer $s\ge2$, we characterize the forests $F$ for which excluding $F$ as an induced minor and $K_{s,s}$ as an induced subgraph bounds tree-independence number. This extends the characterization of Bonnet, Duhamel, and Hickingbotham, who considered bounded pathwidth with $K_{s,s}$ excluded as a subgraph.

math.CO · cs.DM

版本更新 · v2arXiv:2611.13693

Rotating Walks, Derandomized Squares, and Permutation Conjugated Walks

Vedat Levi Alev, Shravas Rao

原文摘要

Using the recent strong convergence results of Bordenave and Collins (Annals of Mathematics) and Chen et al. (Annals of Mathematics), we study the average case behavior of rotating random walks of Cohen and Maor (STOC 2023) and the derandomized square construction of Rozenman and Vadhan (RANDOM 2005). Concretely, we prove a conjecture of Cohen et al. (ITCS 2025) regarding the average case behavior of derandomized squaring for random graphs and show that the existential bounds of Cohen and Maor for their rotating random walk construction hold with high-probability for random graphs. Using the results of O'Donnell and Wu (FOCS 2020), we can in polynomial time construct a family of graphs and rotations which almost saturate the bounds of Cohen and Maor, and meet the bounds conjectured by Cohen et al. for all vertex-transitive auxiliary graphs of fixed degree in the derandomized square. Finally, we study independent random permutation conjugates of deterministic regular graph adjacency matrices. We prove quantitative weak convergence to freely independent tree adjacency operators when the degrees are fixed and the girths tend to infinity. Separately, a covering argument gives deterministic spectral lower bounds for polynomials with non-negative coefficients, recovering the lower bound of Cohen et al. for rotating walks.

math.CO · cs.DM · math.PR

新论文 · v1arXiv:2611.22365

Strong Transitivity of Group Cellular Automata: Characterization and Decidability

Niccolò Castronuovo, Alberto Dennunzio, Luciano Margara

原文摘要

A discrete-time dynamical system is strongly transitive if every point can be reached, in finitely many steps, from every non-empty open set. We study this property for group cellular automata, \ie cellular automata over a finite group alphabet whose global map is a group endomorphism, in every dimension $d\geq1$. We prove that no group cellular automaton over a non-abelian group is strongly transitive, and we develop a decomposition of group cellular automata over abelian groups, via quotients by power subgroups, which preserves strong transitivity. For linear cellular automata over $(\mathbb Z/p\mathbb Z)^n$ we use Pontryagin duality to characterize strong transitivity in terms of the characteristic polynomial $χ_A$ of the associated matrix $A$ of Laurent polynomials: the automaton is strongly transitive if and only if $\det(A)\neq0$ and no irreducible factor of $χ_A$ has an invertible constant term. Combining these results, we obtain that strong transitivity is decidable for group cellular automata in every dimension. For every fixed dimension $d$, we give an explicit decision procedure whose running time is polynomial in the group size $N$, the number $k$ of neighbours, and the neighbourhood radius $\varrho$.

cs.DM · cs.FL · math.DS

版本更新 · v2arXiv:2601.20263

A Quantum Photonic Approach to Graph Coloring

Jesua Epequin, Pascale Bendotti, Joseph Mikael

原文摘要

Gaussian Boson Sampling (GBS) is a quantum computational model that leverages linear optics to solve sampling problems believed to be classically intractable. Recent experimental breakthroughs have demonstrated quantum advantage using GBS, motivating its application to real-world combinatorial optimization problems. In this work, we reformulate the graph coloring problem as an integer programming problem using the independent set formulation. This enables the use of GBS to identify cliques in the complement graph, which correspond to independent sets in the original graph. Our method is benchmarked against classical heuristics and exact algorithms on two sets of instances: Erdős-Rényi random graphs and graphs derived from a smart-charging use case. The results demonstrate that GBS can provide competitive solutions, highlighting its potential as a quantum-enhanced heuristic for graph-based optimization.

quant-ph · cs.DM

新论文 · v1arXiv:2611.22205

More lower bounds for Hales--Jewett and van der Waerden numbers

Younes Mouhib

原文摘要

We give explicit colourings improving the comparison lower bounds assembled here for several Hales--Jewett and van der Waerden numbers. The main algebraic tool generalises Rabung's power-residue colouring from arithmetic progressions to arbitrary sets. If every translate of a t-element set S in F_p meets at least two classes of the r-th power character, and the integer weights have both parities, then a period-2p one-weight colouring of [t]^p has no monochromatic combinatorial line. The 19 displayed algebraic certificates comprise 18 improvements and one closed-form reproduction; they include HJ(4,3)>=164, HJ(5,4)>=7418, and HJ(5,6)>=34034. The underlying period-p construction also proves kappa_ow(t,r)>=p-1 for the one-weight bracket ceiling, in particular kappa_ow(5,4)>=7416 and kappa_ow(5,6)>=34032. Warm breakout-weighted tabu search on the type simplex gives HJ(3,4)>=51. Whole-colouring local search gives W(8,3)>522, W(11,3)>1193, and W(17,3)>3620. All accepted certificates are available separately and are checked by direct enumeration; unresolved searches are reported as UNKNOWN, not UNSAT.

math.CO · cs.DM

新论文 · v1arXiv:2611.21966

Supersaturation and reconfiguration diameter of independent transversals

Wouter Cames van Batenburg, Penny Haxell, Ross J. Kang, Ronen Wdowinski

原文摘要

Consider the collection of independent transversals of a vertex-partitioned graph of maximum degree $Δ$. It is a classic result that when all parts have size at least $2Δ$, the collection is nonempty. Recently, it was found that if the parts have size at least $2Δ+1$, then every pair of independent transversals is connected, within the collection, by a sequence of one-vertex reconfigurations. We prove, among other results, that there are exponentially many independent transversals when the parts have size at least $2Δ$, and that the reconfiguration diameter is at most linear in the number of parts when the parts have size at least $4Δ$.

math.CO · cs.DM

新论文 · v1arXiv:2611.23333

Classification of Forbidden 0-1 Patterns by Their Extremal Function

Jesse Geneson, Seth Pettie

原文摘要

This paper concerns the maximum weight of $n\times n$ 0-1 matrices that avoid some pattern $P$, denoted $\operatorname{ex}(n,P)$. Furedi and Hajnal initiated a research program of classifying all patterns according to their extremal function, but to date, only the weight-4 patterns are completely understood. In this paper we make progress on several fronts of the classification problem. A pattern is light if its columns have weight 1 and linear if $\operatorname{ex}(n,P)=O(n)$. We characterize the set of weight-5 linear light patterns, and the set of weight-5 linear patterns more generally. Along the way we identify several new infinite classes of linear patterns, which support the Pettie-Tardos conjecture on characterizing all linear light patterns. It was known that there exist infinitely many minimally nonlinear patterns. We identify a specific infinite set of minimally nonlinear patterns. We also prove that there are $2^{Ω(r)}$ weight-$r$ minimally nonlinear patterns, and that every minimally nonlinear pattern has extremal function $O(n\log n)$, with the exception of the 4-cycle. We classify many of the outstanding weight-5 patterns according to their extremal function, leaving only a small set remaining. The newly classified weight-5 patterns have extremal function $Θ(n)$ or $Θ(nα(n))$. We also exhibit a large number of weight-6 patterns with extremal function $Θ(n\log n/\log\log n)$, which is notable in that this function had not been encountered before for any single pattern $P$, though it was known to be the correct extremal function for a pair of forbidden patterns.

math.CO · cs.DM

新论文 · v1arXiv:2611.21943

Beyond 4: Improved Competitive Traveling Repairperson

Bibek Maharjan, Gokarna Sharma

原文摘要

With $k\geq 1$ repairpersons starting initially from a depot, we present a 3.877-competitive deterministic algorithm for the fundamental online traveling repairperson problem on an arbitrary metric. For the special class of zero-residual instances, we improve the ratio to $3+ε$ for every $ε>0$. We also extend these results to some variants of the related so-called online dial-a-ride problem. The state-of-the-art is the 4-competitive deterministic algorithm for both problems.

cs.DS · cs.DM · cs.MA

版本更新 · v5arXiv:2609.30302

Hull Games of Induced Path Convexities in Graphs

Eurinardo Costa, Leon Almeida, Rudini Sampaio

原文摘要

In 1984, Frank Harary introduced the first convexity games in graphs, all of them based on the geodesic convexity, which is the graph convexity related to shortest paths. In 2024, Araújo et al. obtained the first PSPACE-hardness proofs on some of these geodesic games and generalized them to any graph convexity. In this paper, we investigate convexity games on several known induced path convexities: the monophonic $\mathrm{m}$-convexity and the $\ell_k$-convexities, based on induced paths and on induced paths of size at most $k$. We prove that the hull games $\mathrm{CHG}_{\mathrm{m}}$, $\mathrm{CHG}_{\ell_k}$ and their misère variants are PSPACE-complete for every $k\ge2$ even in graphs with diameter at most 3. We also use the Sprague-Grundy Theory to obtain a polynomial time algorithm to decide the winner of the games $\mathrm{CHG}_{\mathrm{m}}$ and $\mathrm{CHG}_{\ell_k}$ for any $k\ge2$ in disjoint unions of paths and cycles. For $k\ge3$ odd, we prove that Alice (1st player) wins $\mathrm{CHG}_{\ell_k}$ in the path $P_n$ if and only if $n$ is odd and she wins in the cycle $C_n$ if and only if $n=3$ or $n=α\cdot (k+1)-1$ with $α\ge2$. For $k\ge2$ even, the only periodic nimber sequences of $\mathrm{CHG}_{\ell_k}$ obtained through extensive computational testing occurred for $k=2^h-4$ with $h\ge3$, e.g, $k\in\{4,12,28,60,\ldots\}$. In this case ($k=2^h-4$ with $h\ge3$), we prove that the nimber sequences of $\mathrm{CHG}_{\ell_k}$ in $P_n$ and in $C_n$ are periodic and Alice loses (resp. wins) in $P_n$ (resp. $C_n$) with $n>k$ only when $n=3k+4$ (resp. $n\in\{2k+1,5k+3\}$). Finally, we show that, for $k=2$, the game $\mathrm{CHG}_{\ell_2}$ in paths $P_n$ is closely related to the classical game \emph{Couples-are-Forever} of J. H. Conway: it is still an open problem if the nimber sequence is periodic or not and Alice loses only for 12 values of $n$ up to $200$ million.

cs.DM · math.CO

新论文 · v1arXiv:2611.21540

完全图最小生成树中叶子权重之和

The Sum of Leaf Weights in the Minimum Spanning Tree of the Complete Graph

Julia Gaudio, Phawin Prongpaophan, Miklós Z. Rácz

AI 速读 基于摘要

研究随机加权完全图的最小生成树中与叶子关联的边权重之和,确定其期望极限并证明集中性,进而改进Steiner树和概率最小生成树问题的上界。

cs.DM · math.CO

查看原文摘要

Let $G_n$ be a random weighted complete graph on $n$ vertices, where edges have i.i.d. $\text{Unif}(0,1)$ weights. Let $T_n$ be the Minimum Spanning Tree (MST) of $G_n$. The expected weight of $T_n$ is known to converge to $ζ(3) = \sum_{k=1}^{\infty} \frac{1}{k^3}$ (Frieze 1985). We investigate the sum of weights of edges incident to the leaves of $T_n$, denoting this quantity by $L_n$. We give tight upper and lower bounds on $\mathbb{E}[L_n]$ and determine its limit as $n$ diverges, leveraging typical behavior of sparse Erdős--Rényi random graphs. We also establish concentration of $L_n$ around $\mathbb{E}[L_n]$ and almost sure convergence to this value. These results directly yield substantial improvements to state-of-the-art bounds for two important variants of the MST problem: (1) an improved upper bound on the weight of the optimal random instance Steiner tree, as studied by Bollobás, Gamarnik, Riordan, and Sudakov (2004); and (2) an improvement over the upper bound for the Probabilistic Minimum Spanning Tree, introduced by Bertsimas (1988).

版本更新 · v3arXiv:2402.18537

On the enumeration of signatures of XOR-CNF's

Nadia Creignou, Oscar Defrain, Frédéric Olive, Simon Vilmin

原文摘要

Given a CNF formula $\varphi$ with clauses $C_1, \dots, C_m$ over a set of variables $V$, a truth assignment $\mathbf{a} : V \to \{0, 1\}$ generates a binary sequence $σ_\varphi(\mathbf{a})=(C_1(\mathbf{a}), \ldots, C_m(\mathbf{a}))$, called a signature of $\varphi$, where $C_i(\mathbf{a})=1$ if clause $C_i$ evaluates to 1 under assignment $\mathbf{a}$, and $C_i(\mathbf{a})=0$ otherwise. Signatures and their associated generation problems have given rise to new yet promising research questions in algorithmic enumeration. In a recent paper, Bérczi et al. interestingly proved that generating signatures of a CNF is tractable despite the fact that verifying a solution is hard. They also showed the hardness of finding maximal signatures of an arbitrary CNF due to the intractability of satisfiability in general. Their contribution leaves open the problem of efficiently generating maximal signatures for tractable classes of CNFs, i.e., those for which satisfiability can be solved in polynomial time. Stepping into that direction, we completely characterize the complexity of generating all, minimal, and maximal signatures for XOR-CNFs.

cs.DS · cs.DM · math.CO

新论文 · v1arXiv:2611.21256

Odd faces as a parameter for maximum independent set in embedded graphs

Samuel Fiorini, Stefan Kober, Caleb McFarland

原文摘要

We give a polynomial-time algorithm for finding a maximum weight independent set in a graph embedded in a surface of bounded genus and with a bounded number of vertex-disjoint odd faces. In particular, we obtain an algorithm for graphs with an even-faced embedding in a torus and for planar graphs with a bounded number of odd faces, answering a question of Thomassé (2018) and a question of Choi, Gorsky, Kim, McFarland, and Wiederrecht (2025) respectively. We reduce the original problem to finding a minimum cost non-negative integer circulation with homology constraints in the dual of a certain double cover of the original graph.

math.CO · cs.DM · cs.DS · math.OC

版本更新 · v2arXiv:2603.27655

Exact Algorithms for Edge Deletion to Cactus

Sheikh Shakil Akhtar, Geevarghese Philip

原文摘要

We study two related problems on simple, un-directed graphs: Edge Deletion to Cactus and Spanning Tree to Cactus. Edge Deletion to Cactus has been known to be NP-hard on general graphs at least since 1988. We show improved exact algorithms for the former and a polynomial time algorithm for the latter.

cs.DS · cs.CC · cs.DM · math.CO