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

推荐订阅源

IT之家
IT之家
博客园_首页
S
SegmentFault 最新的问题
罗磊的独立博客
博客园 - 【当耐特】
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
阮一峰的网络日志
阮一峰的网络日志
D
Docker
雷峰网
雷峰网
Google DeepMind News
Google DeepMind News
博客园 - 司徒正美
V
V2EX
大猫的无限游戏
大猫的无限游戏
V
Visual Studio Blog
腾讯CDC
宝玉的分享
宝玉的分享
酷 壳 – CoolShell
酷 壳 – CoolShell
人人都是产品经理
人人都是产品经理
T
Tailwind CSS Blog
Vercel News
Vercel News
H
Help Net Security
博客园 - Franky
D
DataBreaches.Net
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}}$
Existence and bounds of growth constants for restricted w...
Sun Woo P. Kim, Gabriele Pinna · 2025-09-05 · via math.CO updates on arXiv.org

We introduce classes of restricted walks, surfaces and their generalisations. For example, self-osculating walks (SOWs) are supersets of self-avoiding walks (SAWs) where edges are still not allowed to cross but may 'kiss' at a vertex. They are analogous to osculating polygons introduced in (Jensen and Guttmann, 1998) except that they are not required to be closed. The 'automata' method of (Pönitz and Tittmann, 2000) can be adapted to such restricted walks. For example, we prove upper bounds for the connective constant for SOWs on the square and triangular lattices to be $μ^{\mathrm{SOW}}_\square \leq 2.73911$ and $μ^{\mathrm{SOW}}_\triangle \leq 4.44931$, respectively. In analogy, we also introduce self-osculating surfaces (SOSs), a superset of self-avoiding surfaces (SASs) which can be generated from fixed polyominoids (XDs). We further generalise and define self-avoiding $k$-manifolds (SAMs) and its supersets, self-osculating $k$-manifolds (SOMs) in the $d$-dim hypercubic lattice and $(d, k)$-XDs. By adapting the concatenation procedure procedure (van Rensburg and Whittington, 1989), we prove that their growth constants exist, and prove an explicit form for their upper and lower bounds. The upper bounds can be improved by adapting the 'twig' method, originally developed for polyominoes (Eden, 1961, Klarner and Rivest, 1973). For the cubic lattice, we find improved upper bounds for the growth constant of SASs as $μ^{\mathrm{SAS}}_{\mathbb{Z}^3} \leq 17.11728$.