跳到正文
研踪PaperTrail

YOUR RESEARCH, IN SIGHT

让下一篇重要论文，不再错过。

覆盖计算机全学科，以 AI 为快捷入口。关注方向、作者和关键词，把发现变成持续的研究积累。

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

全站更新概况

+1622新增论文
+1249其中 AI 相关
+172已有论文修订
+100新增 AI 导读

arXiv 最近完成扫描：2026-11-11 13:10 · 全站最近入库：2026-11-11 13:09各信源进度 →

统计口径与数据新鲜度

统计 2026-11-10 13:54 — 2026-11-11 13:54（北京时间） · 点击数字查看对应简报；AI 相关包含在新增论文内。

最近完成检查：2026-11-11 13:10最近发现新增版本：2026-11-11 13:09库内论文最新更新时间：2026-11-11 08:00

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

21,672 已收录论文18,320 AI 相关6,055 有修订112 HF 社区发现

浏览论文库

研究日报 / 周报 →按信源浏览 →

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

找到 4 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-11 13:06（北京时间）
版本更新 · v2arXiv:2605.12457

Layer-Based Width for PAFP

Samuel German

原文摘要

The Path Avoiding Forbidden Pairs problem (PAFP) asks whether, in a directed graph $G$ with two of its vertices labeled $s,t$ and a set $\mathcal F$ of forbidden vertex pairs, there is an $s$--$t$ path that contains at most one endpoint from each pair in $\mathcal F$. We initiate the study of PAFP through a layer-based width measure. We first look at the directed union digraph $G\cup\mathcal F$, which is obtained by adding one arc per forbidden pair to $G$, oriented according to a fixed reachability-compatible order. Let the BFS layer $L_d$ be the set of vertices at directed shortest-path distance $d$ from $s$, and define the BFS-width from $s$ as $\max_d |L_d|$. We show that if $G\cup\mathcal F$ has BFS-width $b$ from $s$, and $p$ is the maximum, over BFS-layer cuts, of the smaller of the numbers of distinct heads and distinct tails of backward arcs crossing the cut, then PAFP is FPT parameterized by $b+p$. Here a backward arc goes from a later BFS layer to an earlier one. In contrast, we show that bounded BFS-width alone does not suffice: PAFP remains $\mathsf{NP}$-complete when the union digraph has BFS-width 2. We also study layer-based width parameters on the input graph. We show that if the input DAG has BFS-width at most $2$ and only $k$ backward input arcs, then PAFP can be decided in $2^k |I|^{O(1)}$ time, with unrestricted forbidden pairs, and this result is tight. Moreover, we study exact-length layers in the input graph, where the $d$-th exact-length layer consists of the vertices reachable from $s$ by a directed path of length exactly $d$. We show that for DAGs of exact-length width at most $2$, PAFP is polynomial-time decidable by a $2$-SAT encoding of fixed-length paths. Unlike previously known polynomial-time regimes our 2 input -graph tractability results simultaneously allow unrestricted forbidden pairs and input graphs with exponentially many $s$--$t$ paths.

cs.DS · cs.DM

查看论文
arXiv ↗PDF ↗
版本更新 · v2arXiv:2605.13385

Exact Accepting-State Spectrum for Reversal of Permutation Automata

Samuel German

原文摘要

In this paper we determine the accepting-state spectrum of the reversal operation on permutation automata, and moreover prove the conjecture conjectured by Rauch and Holzer in so doing. Namely, we show that reversal satisfies the spectrum $g^{\operatorname{asc}}_{R,\mathrm{PFA}}(0)=\{0\}$, $g^{\operatorname{asc}}_{R,\mathrm{PFA}}(1)=\{1\}$, and $g^{\operatorname{asc}}_{R,\mathrm{PFA}}(m)=\mathbb{N}_{\ge 2}$ for $m\ge 2$. We do this by, for every $m\ge 2$ and every $α\ge 2$, constructing a binary permutation automaton $A_{m,α}$ such that $ \operatorname{asc}(L(A_{m,α}))=m$ and $ \operatorname{asc}(L(A_{m,α})^{R})=α$. The spectrum above follows from this (combined with the trivial cases $m=0$ and $m=1$ and the fact that $1$ is magic for every $m\ge 2$). Thus our result shows that for $m \ge 2$, the reversal operation in permutation automaton attains ever single value positive value in the accepting-state complexity except for $1$.

cs.FL

查看论文
arXiv ↗PDF ↗
版本更新 · v2arXiv:2605.10852

A Unary-to-Nonunary Transition in the Accepting-State Spectrum of Right Quotient for Permutation Automata

Samuel German

原文摘要

This paper determines the accepting-state spectrum of the right-quotient operation for permutation automata, solving an open problem posed by Rauch and Holzer. They showed that in the unary case in which the languages whose right quotient we consider are languages over an alphabet with but one symbol, the accepting state complexities which could ensue for automata recognizing their quotient is exactly all integers between $1$ and $mn$ inclusive when $m,n \ge 1$; we show that for arbitrary alphabets the accepting-state spectrum is $g^{\operatorname{asc}}_{-1,\mathrm{PFA}}(m,n)=\{0\}$ if $m=0$ or $n=0$, and $g^{\operatorname{asc}}_{-1,\mathrm{PFA}}(m,n)=\mathbb{N}_{>0}$ if $m,n\ge 1$. Our result shows that every positive accepting-state complexity ensues for right quotient as long as both of the languages of which we consider the right quotient are nonempty. $0$ becomes the only unavoidable magic value. Moreover, we show that an alphabet with just two letters can witness any arbitrary $α\ge 1$ when $m,n \ge 1$, in that languages can be defined over a binary alphabet with accepting-state complexity $m$ and $n$ respectively for which their right quotient has accepting-state complexity $α$. What ultimately happens in our proof is that we construct $(A^{\mathrm q}_{m,α},B^{\mathrm q}_{n,α})$ such that the words accepted by $B^{\mathrm q}_{n,α}$ induce a point stabilizer in a symmetric group, and the standard quotient construction giving an automaton recognizing the quotient language then saturates the original final set of $A^{\mathrm q}_{m,α}$ to a full orbit; this gives a minimal quotient automaton with exactly $α$ final states. The complete spectrum which is our result follows from this, solving the open question of what the right quotient's accepting-state complexity for permutation automata is.

cs.FL

查看论文
arXiv ↗PDF ↗
版本更新 · v2arXiv:2605.13299

Strong Conflict-Free Vertex-Connection via Twin Cover: Kernelization and Chromatic Bounds

Samuel German

原文摘要

A strong conflict-free vertex connection coloring of a graph is a graph coloring for which, for every two distinct vertices of the graph, there exists a shortest path between them in which some color in said coloring appears only once. The strong conflict-free vertex connection number, denoted by $\operatorname{svcfc}(G)$, is the number of colors in the strong conflict-free vertex connection coloring with the smallest amount of colors out of all such colorings of $G$. We study the problem of deciding whether this number is at most some threshold together with the parameter twin cover. Our first result is that when we have given $(G,k)$ in which $k$ is some target number of colors and given some twin cover $X$ of $G$ which is of size $t$, there is a polynomial time reduction to an equivalent instance which has at most $\max\{2,t+k2^t\}$ vertices. This result allows us to give a kernel for Strong CFVC Number which is parameterized by $\operatorname{tc}(G)+k$, which implies that Strong CFVC Number is FPT w.r.t. the twin-cover number of $G$ so long as $k$ is fixed. Our second result is that if $G$ is a connected graph for which there exists a twin cover of size $t$, then $χ(G)\le \operatorname{svcfc}(G)\le χ(G)+t$. Our last result is an an exact expression for the chromatic number of graphs whose twin cover number is bounded. Namely, we show that for every proper coloring $\varphi$ of $G[X]$, the minimum number of colors needed to extend $\varphi$ to all of $G$ is $K_\varphi=\max_{S\subseteq X}(|\varphi(S)|+m(S))$, and hence $χ(G)=\min_{\varphi\text{ proper on }G[X]} K_\varphi$. Our results indicate that twin cover is a meaningful parameter in the context of strong conflict-free vertex-connection, and show that once we have a fixed twin cover, the only difficulty left is in some additive threshold above the chromatic number.

cs.DM · cs.DS

查看论文
arXiv ↗PDF ↗