SearcharxivSearch

arXiv subjects

Alexander Omelchenko

Publications and source records attributed to Alexander Omelchenko.

18 recordsLinked to original sources

Below-threshold Bistability and Implementation Lag in a Simplex Model of Radical Vote-Share Dynamics

We study a nonautonomous compartmental model on the probability simplex for radical vote-share dynamics under delayed policy implementation. The model distinguishes a target regime from an effective regime that adjusts with finite speed and includes a persistent alienation reservoir that can later be mobilised by radical actors. In a symmetric benchmark, persistent alienation destroys the global one-threshold picture: below the local instability threshold, a radical-free centrist--alienated equilibrium may coexist with a stable positive equilibrium, separated by a saddle branch created in a saddle-node bifurcation. By hyperbolic persistence, this coexistence survives near the symmetric baseline, while numerical exploration identifies a wider bistable region under asymmetric perturbations. Delayed implementation further separates target and effective threshold passage, producing a parameter-space lag and an additional state-space lag before a visible response in radical support. The analysis combines a Perron--Frobenius threshold for the frozen radical-free equilibrium, a geometric characterisation of positive equilibria, local adiabatic tracking under slow uniformly subcritical drift, and explicit delay bounds for transversal threshold passage. Under initial matching, the parameter-space delay scales as \(O(\kappa_\theta^{-1})\); in a monotone ramp example the bound is nearly attained, whereas the state-space lag is substantially larger and less sensitive to implementation speed. Thus threshold restoration is preventive rather than curative: once the trajectory enters the basin of the radicalised attractor, returning below the local threshold need not restore the radical-free regime.

math.DS

Mean Time to Remediate Is Not a Fielding Model: A Cadence Audit for Enterprise Vulnerability Management

Enterprise security teams commonly summarize remediation through mean time to remediate (MTTR), SLA compliance, dwell time, or detection delay. These metrics are useful, but they can hide how fixes actually reach the estate: continuously, through scheduled maintenance windows, in deployment rings, or through emergency bypass paths. This paper introduces a remediation-cadence audit for enterprise vulnerability management. The audit records routine mean lag, release period, release fraction, cohort geometry, emergency/routine split, non-fielding delay, local residual-pressure evidence, and declared rate scenario. It compares a continuous same-mean shortcut with the recorded release calendar and reports a local capacity verdict plus a calendar discount: the fraction of mean-only local capacity consumed by calendarized fielding. Worked notional packets with the same 30-day mean lag show why this matters. Under the normalized screening scenario, a two-month release train consumes 17.4\% of mean-only capacity, a monthly train 5.2\%, and a two-week screen 1.3\%; across a 16-fold attacker-adjustment rate band, the two-month discount remains at least about 12\% and the monthly discount stays in the resolution-sensitive 3--8\% range. The audit therefore turns cadence assessment into an evidence-resolution question: when the discount is material relative to residual-pressure uncertainty or claimed headroom, MTTR/SLA should not be used alone as fielding evidence. Release-geometry checks show that deployment rings do not automatically recover the continuous benchmark, and cohort staggering can help or hurt near capacity. The result is a reproducible governance diagnostic, not a breach predictor or CVE prioritizer.

cs.CR

Implementation Filters and Delay-Budget Instability in Coupled Replicator--Mutator Dynamics

We model an adaptive contest in which two antagonistically coupled populations continually reallocate effort among competing methods, but decisions are not fielded instantly. Each side has an intended portfolio and a deployed portfolio: intended reallocations follow delayed observations of the opponent, while deployment follows intent through a first-order implementation filter. Under barycentric balance and uniform exploration, the linearized scalar branches have a characteristic factor in which hard observation and deployment lags enter only through their total sum, whereas implementation rates enter through real filter factors that cannot be absorbed into selection or exploration. In the strictly antagonistic class, negative spectral branches split into three regimes: weak branches have no positive-frequency crossing, intermediate branches lose stability through a delay-induced Hopf bifurcation, and strong branches are at or beyond the implementation-filter instability margin already at zero hard delay. This gives an operational delay-budget rule: in the delay-induced window, reducing any hard lag has the same first-order stabilizing leverage at onset; in the filter-induced regime, hard-lag reduction alone cannot restore stability. Balanced scalar performance observables generically show a mean shift and a second harmonic at twice the compositional frequency, and under strict antagonism the two performance signals are locked in antiphase with fixed amplitude ratio. For a baseline branch, a finite-dimensional Hopf normal-form calculation gives a negative cubic coefficient, and direct simulations reproduce the predicted threshold, amplitude scaling, and observable signatures. Motivating applications include cybersecurity and rapid technological countermeasure adaptation.

math.DS

Affine weighted Motzkin paths and the differential kernel method

We study Motzkin paths whose up-, level-, and down-step weights are affine functions of the height: alpha_k = A k + alpha_0, gamma_k = B k + gamma_0, beta_k = C k + beta_0. Let w_{n,k} be the total weight of paths of length n ending at height k, and let W_n = w_{n,0} be the return column. For affine weights the row recurrence becomes a first-order differential equation in the variable marking terminal height, and, unless beta_0 = C, that equation involves the unknown return series as boundary data. We show that the return series is nevertheless determined by the step rule alone: a characteristic ending on the floor forces a cancellation and yields an Abel-Volterra equation for the returns, while the same identity read at an interior point reconstructs the entire triangle (w_{n,k}). We call this boundary cancellation the differential kernel method; it takes the place of substituting an admissible kernel root, which is unavailable because the equation is differential rather than algebraic in the catalytic variable. When the boundary index nu = (beta_0 - C)/C is a positive integer m, the construction becomes finite and combinatorial: shifting every height by m turns the divided-difference evolution into an ordinary weighted path model on a half-line carrying m virtual levels below the visible floor, and a first-entry decomposition expresses (w_{n,k}) through two such local models. Exactly one bridge, of weight alpha_0 - A, leads from the virtual strip back to the visible region; it is closed, and the terminal-height columns factorise, precisely when alpha_0 = A. For the Dyck weights alpha_k = k+1, beta_k = k+nu+1, gamma_k = 0 this gives sum_{n>=0} w_{n,k} t^n / n! = sec^{nu+1}(t) tan^k(t).

math.CO

Exhaustive Generation of Genus-One Knot and Link Diagrams via Maps on the Torus

We present an algorithmic framework for the exhaustive generation and tabulation of knot and link diagrams on the thickened torus T^2 x I, based on the theory of maps on surfaces. Cellular 4-regular torus projections are encoded by permutation pairs (alpha, sigma), and unsensed equivalence classes are enumerated completely and without duplication via canonical representatives. Crossing assignments, local diagram-level reductions, and the generalized Kauffman-type bracket are formulated entirely within the same permutation model. The pipeline is validated against published genus-one classifications for crossing numbers N <= 5 and then extended to N = 6, 7, 8, producing, to our knowledge, the first complete genus-one tabulation at these crossing numbers under the stated comparison conventions. The resulting dataset contains more than 33,000 knot and link types. Besides the tables, the computation yields proved structural facts, including a parity statement for the a-span of the bracket and a sharp upper bound N-1 for the number of bigon faces in a 4-regular torus map. It also suggests several conjectures, among them a formula for the maximum number of straight-ahead components, the absence of equi-quadrilateral knot projections, and a 4N upper bound for the genus-one bracket span.

cs.DM

Threshold-Safe Shock Absorption in a Compartmental Voter-Flow Model:\ A Conservative Impulse-Control Benchmark

We formulate a deterministic threshold-safety problem for a reduced compartmental voter-flow model. An exogenous load enters an alienation reservoir; between releases the reservoir recovers exponentially. Near the mainstream baseline the compartmental dynamics have a linear-stability threshold \(\Delta_c\): below this level the mobilised component contracts, while above it transient amplification is possible. The paper introduces an impulse-control layer for this threshold mechanism. The threshold is obtained from the local stability boundary of the reduced dynamical system, the exposure functional is tied to positive logarithmic amplification, and the scalar reservoir model is proved to be a conservative envelope of the nonlinear voter-flow dynamics. This bridge yields explicit safety benchmarks: the single-release exposure and its zero buffer, the complete-relaxation splitting problem with fixed per-release overhead, the finite-recovery constant-peak profile, and the fixed-horizon capacity frontier \(\Delta_c(1+\rho T)\). The scalar recurrence used after the reduction is the familiar leaky-reservoir skeleton also found in multiple-dose pharmacokinetics, fractionated radiotherapy, reservoir operation, and setup-cost scheduling. Its role here is to make the threshold regimes of the compartmental shock-absorption model analytically transparent.

math.OC

Crisis, Disengagement, and Structural Realignment: A Threshold Model of Radical-Party Support

When does a crisis-induced surge in radical-party support fade away, and when does it become a durable realignment? We address this in a mathematical sociology threshold model on a conserved population. The baseline admits a global classification through a Perron--Frobenius threshold. Adding a crisis-induced disengagement compartment, we separate state shocks (which alter the current state) from structural shocks (which alter parameters). State shocks affect transients but cannot move the long-run attractor; durable realignment requires structural threshold-crossing. We derive a critical shock amplitude and a finite mobilisation-window bound, and show that cumulative structural shifts can produce staircase realignment. A stylised illustration uses German federal elections, 2013--2025.

physics.soc-ph

Threshold Dynamics of Voter Radicalization on the Probability Simplex

We analyse two coupled ODE models of political competition on invariant probability simplices with a conserved electorate. The baseline three-group model tracks left-radical, centrist, and right-radical voter shares. We characterise the unique interior equilibrium by a Perron--Frobenius threshold, establish global asymptotic stability in the symmetric and asymmetric cases, and exclude periodic orbits unconditionally via the Dulac criterion. A structural consequence is that the baseline model cannot produce irreversible centrist decline, history-dependent long-run floors, or multiple attractors. We then extend the model with a disengaged voter compartment and distinguish pure state shocks from permanent structural parameter shifts. The post-shock dynamics are governed by the same spectral threshold: below it the centrist state is globally asymptotically stable; above it every trajectory with a nonzero radical seed converges to the unique radicalised equilibrium. Cumulative sub-threshold structural shifts can cross the threshold and produce staircase dynamics absent from the baseline; the symmetric reduction yields closed-form expressions for the critical shock amplitude and the radicalization window.

math.DS

Balanced affine Motzkin paths: Pearson geometry and global endpoint asymptotics

We study endpoint distributions of balanced affine weighted Motzkin paths. In the balanced case, the generating-function equation has Pearson-type characteristic geometry. We show that this geometry controls the terminal-height law globally: the characteristic escape time determines the limiting cumulant generating function, the large-deviation rate function, and the ray-scale asymptotics. Thus the usual Gaussian window is only the local quadratic approximation to a global Pearson-driven profile. For finite sizes, we prove a uniform Daniels saddlepoint approximation in the one-dominant-singularity regimes and identify the exceptional antipodal case requiring a lattice/interference correction.

math.PR

Maps on Surfaces and the Tabulation of Knots and Links in the Thickened Torus Through Ten Crossings

We give a combinatorial tabulation of knots and links in the thickened torus $T^2 \times I$ based on the theory of maps on surfaces: cellular $4$-regular torus projections are encoded by permutation pairs, and unsensed equivalence classes are enumerated completely and without duplication by canonical representatives. The method is validated against published genus-one tables for $N \le 5$ and extended to $N=6,7,8,9,10$, producing, to our knowledge, the first complete tabulation of prime knot and link diagram types in the fixed thickened torus $T^2 \times I$ at these crossing numbers, under the conventions stated below -- more than $1.3$ million knot and link types in total. The computation yields three proved structural results on straight-ahead components, bigon faces, and the parity of the $a$-span of the genus-one bracket, together with several conjectures, including a $4N$ bound on the $a$-span in the spirit of the Kauffman--Murasugi--Thistlethwaite theorem. A reference implementation and machine-readable datasets are provided.

math.CO

Enumeration of Unsensed Orientable Maps on Surfaces of a Given Genus

In this work for the first time we enumerate unlabelled maps on orientable genus $g$ surfaces with respect to all homeomorphisms, including both orientation-preserving and orientation-reversing. We show that in the latter case as an intermediate step one has to enumerate rooted maps of a special kind (quotient maps) on orientable and non-orientable surfaces possibly having a boundary and a certain number of branch points. In this work we develop a special technique for enumerating such maps.

math.CO

Unsensed enumeration of cubic unicellular maps on orientable and non-orientable surfaces

We enumerate cubic (3-regular) unicellular maps on closed surfaces up to all homeomorphisms. Using the orbifold approach, we reduce the unsensed enumeration to explicit counts of quotient maps and rooted cubic/precubic maps on simpler surfaces. For orientable hosts this yields a compact identity expressed through known sensed and rooted numbers; for non orientable hosts we obtain a fully explicit finite sum expression via precubic counts. Numerical tables are provided, together with a brief asymptotic discussion.

math.CO

Enumeration of $r$-regular Maps on the Torus. Part I: Enumeration of Rooted and Sensed Maps

The work that consists of two parts is devoted to the problem of enumerating unrooted $r$-regular maps on the torus up to all its symmetries. We begin with enumerating near-$r$-regular rooted maps on the torus, projective plane and the Klein bottle. We also present the results of enumerating some special kinds of maps on the sphere: near-$r$-regular maps, maps with multiple leaves and maps with multiple root semi-edges. For $r=3$ and $r=4$ we obtain exact analytical formulas. For larger $r$ we derive recurrence relations. Then using these results we enumerate $r$-regular maps on the torus up to homeomorphisms that preserve its orientation --- so-called sensed maps. Using the concept of a quotient map on an orbifold we reduce this problem to enumeration of certain classes of rooted maps. For $r=3$ and $r=4$ we obtain closed-form expressions for the numbers of $r$-regular sensed maps by edges. All these results will be used in the second part of the work to enumerate $r$-regular maps on the torus up to all homeomorphisms --- so-called unsensed maps.

math.CO

Enumeration of $r$-regular Maps on the Torus. Part II: Enumeration of Unsensed Maps

The second part of the paper is devoted to enumeration of $r$-regular toroidal maps up to all homeomorphisms of the torus (unsensed maps). We describe in detail the periodic orientation reversing homeomorphisms of the torus which turn out to be representable as glide reflections. We show that considering quotients of the torus with respect to these homeomorphisms leads to maps on the Klein bottle, annulus and the Möbius band. Using $3$- and $4$-regular maps as an example we describe the technique of enumerating quotient maps on surfaces with a boundary. Obtained recurrence relations are used to enumerate unsensed $r$-regular maps on the torus for various $r$.

math.CO

Enumeration of Chord Diagrams without Loops and Parallel Chords

We enumerate chord diagrams without loops and without both loops and parallel chords. We show that the former ones describe Hamiltonian paths in $n$-dimensional octahedrons. The latter ones are also known as shapes. For labelled diagrams we obtain generating functions, for unlabelled ones we derive recurrence relations.

math.CO

Classification of $k$-tangle projections using cascade representation

The paper addresses the $k$-tangle enumeration problem. We introduce a notion of cascade diagram for $k$-tangle projections. An effective enumeration algorithm for projections is proposed based on cascade representation. Tangles projections with up to 12 crossings are tabulated. We provide also pictures of alternating $k$-tangles with 5 crossing or less.

math.GT