Related papers: T-systems with boundaries from network solutions
Time-independent scattering methods are widely used to analyze transport in periodic $\mathcal{PT}$-symmetric systems. However, their predictions become unphysical when the system supports time-growing bound states (TGBSs), which manifest…
A complex network is a condensed representation of the relational topological framework of a complex system. A main reason for the existence of such networks is the transmission of items through the entities of these complex systems. Here,…
The entropy of a hierarchical network topology in an ensemble of sparse random networks with "hidden variables" associated to its nodes, is the log-likelihood that a given network topology is present in the chosen ensemble.We obtain a…
Multi-view subspace clustering methods have employed learned self-representation tensors from different tensor decompositions to exploit low rank information. However, the data structures embedded with self-representation tensors may vary…
The learnability of different neural architectures can be characterized directly by computable measures of data complexity. In this paper, we reframe the problem of architecture selection as understanding how data determines the most…
In this paper we investigate a relaxed concept of controllability, known in the literature as herdability, namely the capability of a system to be driven towards the(interior of the) positive orthant. Specifically, we investigate…
This paper is divided into two parts. The first is a review, through categorical lenses, of the classical theory of regular-singular differential systems over $C((x))$ and $\mathbb P^1_C\smallsetminus\{0,\infty\}$, where $C$ is…
We fulfill the rough topological analysis of the problem of the motion of the Kovalevskaya top in a double field. This problem is described by a completely integrable system with three degrees of freedom not reducible to a family of systems…
In recent work, the authors developed a simple method of constructing topological spaces from certain well-behaved partially ordered sets -- those coming from sequences of relations between finite sets. This method associates a given poset…
We review several constructions of integrable systems with an underlying cluster algebra structure, in particular the Gekhtman-Shapiro-Tabachnikov-Vainshtein construction based on perfect networks and the Goncharov-Kenyon approach based on…
In this paper we explore how non trivial boundary conditions could influence the entanglement entropy in a topological order in 2+1 dimensions. Specifically we consider the special class of topological orders describable by the quantum…
We prove a complexity lower bound on deciding membership in a semialgebraic set for arithmetic networks in terms of the sum of Betti numbers with respect to "ordinary" (singular) homology. This result complements a similar lower bound by…
Nonlinear control-affine systems described by ordinary differential equations with bounded measurable input functions are considered. The solvability of general boundary value problems for these systems is formulated in the sense of…
The local theory for regular and multi-regular systems was developed in the assumption that these systems are Delone sets, or (r;R)-systems. The requirement for a set to be a (r;R)-system particularly implies that any two points in a Delone…
In this paper, we compute the iterated derived sets of the set of multiple t-values under the usual topology of R. Our results imply that the set of multiple t-values, ordered by >=, is a well-ordered set.
Motivated by algebraic quantum field theory and our previous work we study properties of inductive systems of \ $C^*$-algebras over arbitrary partially ordered sets. A partially ordered set can be represented as the union of the family of…
We prove among other things that the omega-limit set of a bounded solution of a Hamilton system \[\left\{\begin{aligned} & \mathbf{\dot{p}}=\frac{\partial H}{\partial \mathbf{q}} & \mathbf{\dot{q}}=-\frac{\partial H}{\partial \mathbf{p}} \\…
We obtain bounded for all $t$ solutions of ordinary differential equations as limits of the solutions of the corresponding Dirichlet problems on $(-L,L)$, with $L \rightarrow \infty$. We derive a priori estimates for the Dirichlet problems,…
Classical shortest-path methods rely on binary tropical semirings $(\min,+)$, whose dyadic structure limits them to pairwise cost interactions. However, many real-world systems, including logistics, supply chains, communication networks,…
Latent variable models for network data extract a summary of the relational structure underlying an observed network. The simplest possible models subdivide nodes of the network into clusters; the probability of a link between any two nodes…