相关论文: On the local base set of primitive and nonpowerful…

We elaborate on the principle that for gapped quantum spin systems with local interaction "local perturbations [in the Hamiltonian] perturb locally [the ground state]". This principle was established in [Bachmann et al. 2012], relying on…

The periodic (ordinal) patterns of a map are the permutations realized by the relative order of the points in its periodic orbits. We give a combinatorial characterization of the periodic patterns of an arbitrary signed shift, in terms of…

Szalai et al. (SIAM J. on Sci. Comp. 28(4), 2006) gave a general construction for characteristic matrices for systems of linear delay-differential equations with periodic coefficients. First, we show that matrices constructed in this way…

We present a general result about generating group topologies by pseudo-norms. Namely, we show that if a topology has a base of sets which are closed in a certain sense, then it can be generated by a collection of pseudo-norms such that the…

We study signed differential posets, a signed version of differential posets. These posets satisfy enumerative identities which are signed analogues of those satisfied by differential posets. Our main motivations are the sign-imbalance…

Determinantal point process have recently been used as models in machine learning and this has raised questions regarding the characterizations of conditional independence. In this paper we investigate characterizations of conditional…

This paper is the last part of a comprehensive survey of a newly emerging field: a topological approach to the study of locally finite graphs that crucially incorporates their ends. Topological arcs and circles, which may pass through ends,…

We study the problem of $P$-interpolation, where $P$ is a set of binary predicate symbols, for certain classes of local extensions of a base theory. For computing the $P$-interpolating terms, we use a hierarchic approach: This allows us to…

In this paper, we introduce the notions of matching matrices in groups and vector spaces, which lead to some necessary conditions for existence of acyclic matching in abelian groups and its linear analogue. We also study the linear local…

A digraph that represents reasonably a scheduling problem should be a directed acyclic graph. Here down we shall deal with special kind of graded $DAGs$ named $KoDAGs$. For their definition and first primary properties see $ [1]$, where…

In this paper, we introduce a novel class of graphical models for representing time lag specific causal relationships and independencies of multivariate time series with unobserved confounders. We completely characterize these graphs and…

We establish some properties of substochastic matrices that we haven't been able to find in the literature

We use Maynard's methods to show that there are bounded gaps between primes in the sequence $\{\lfloor n\alpha\rfloor\}$, where $\alpha$ is an irrational number of finite type. In addition, given a superlinear function $f$ satisfying some…

First-order logic is known to have limited expressive power over finite structures. It enjoys in particular the locality property, which states that first-order formulae cannot have a global view of a structure. This limitation ensures on…

The finite basis property is often connected with the finite rank property, which it entails. Many examples have been produced of finite rank varieties which are not finitely based. In this note, we establish a result on nilpotent…

Analyzing nodal domains is a way to discern the structure of eigenvectors of operators on a graph. We give a new definition extending the concept of nodal domains to arbitrary signed graphs, and therefore to arbitrary symmetric matrices. We…

While topology given by a linear order has been extensively studied, this cannot be said about the case when the order is given only locally. The aim of this paper is to fill this gap. We consider relation between local orderability and…

A digraph is semicomplete if any two vertices are connected by at least one arc and is locally semicomplete if the out-neighbourhood and the in-neighbourhood of any vertex induce a semicomplete digraph. In this paper we study various…

We propose the notions of uniform local weak o-minimality and $*$-local weak o-minimality. Local monotonicity theorems hold in definably complete locally o-minimal structures and uniformly locally o-minimal structures of the second kind. In…

This work is a comparative study between the existence of fixed point for homomorphisms in a class of binary relationnal systems and the existence of fixed point for nonexpansive mappings in semimetric spaces.