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

推荐订阅源

The Cloudflare Blog
U
Unit 42
F
Fortinet All Blogs
雷峰网
雷峰网
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
月光博客
月光博客
Y
Y Combinator Blog
罗磊的独立博客
V
Visual Studio Blog
大猫的无限游戏
大猫的无限游戏
J
Java Code Geeks
量子位
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
爱范儿
爱范儿
B
Blog RSS Feed
aimingoo的专栏
aimingoo的专栏
有赞技术团队
有赞技术团队
T
Tailwind CSS Blog
Microsoft Security Blog
Microsoft Security Blog
L
LangChain Blog
I
InfoQ
博客园 - 叶小钗
博客园 - 聂微东
Last Week in AI
Last Week in AI

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}}$
On some integrable models in inhomogeneous space
Theodoros Assiotis · 2023-10-27 · via math.CO updates on arXiv.org

The purpose of this work is to build a framework that allows for an in-depth study of various generalisations to inhomogeneous space of models of Borodin-Ferrari, Dieker-Warren, Nordenstam, Warren-Windridge of interacting particles in interlacing arrays, both in discrete and continuous time, involving both Bernoulli and geometric jumps. The models can in addition be either time-inhomogeneous or particle-inhomogeneous. We show that the correlation functions of these models are determinantal and using this we prove a short-time asymptotic for these dynamics to the discrete Bessel point process. We moreover prove a number of closely related results. We prove that the autonomous, inhomogeneous in space and time, TASEP-like and pushTASEP-like particle systems on the edges of the array have explicit transition kernels and that from any deterministic initial condition their distributions are marginals of a determinantal measure. We prove a novel duality relation between dynamics in inhomogeneous space and dynamics with inhomogeneities on the level of the array. We extend the work of Nordenstam on the shuffling algorithm for domino tilings of the Aztec diamond and its relation to push-block dynamics in interlacing arrays to general weights on the tilings and then connect this, for a special class of weights, back to our previous results. We also consider non-intersecting walks in inhomogeneous space and time with fixed starting and end points and obtain a formula for their correlation functions, involving among other ingredients, an explicit Riemann-Hilbert problem. We then prove a limit theorem for the bottom lines in this line-ensemble, under some technical conditions. The main computational tool throughout this work is a natural generalisation of a Toeplitz matrix, that we call inhomogeneous Toeplitz-like matrix $\mathsf{T}_{\mathbf{f}}$ with (a possibly matrix-valued) symbol $\mathbf{f}$.