Related papers: Factor system for graphs and combinatorial HHS
Geometric modeling by constraints leads to large systems of algebraic equations. This paper studies bipartite graphs underlaid by systems of equations. It shows how these graphs make possible to polynomially decompose these systems into…
The paper deals with combinatorial and stochastic structures of cubical token systems. A cubical token system is an instance of a token system, which in turn is an instance of a transition system. It is shown that some basic results of…
For a CAT(0) cube complex $\mathbf X$, we define a simplicial flag complex $\partial_\Delta\mathbf X$, called the \emph{simplicial boundary}, which is a natural setting for studying non-hyperbolic behavior of $\mathbf X$. We compare…
Let S be the spectrum of a discrete valuation ring with function field K. Let X be a scheme over S. We will say that X is semi-factorial over S if each invertible sheaf on the generic fiber X_K can be extended to an invertible sheaf on X.…
Consider a graph having quantum systems lying at each node. Suppose that the whole thing evolves in discrete time steps, according to a global, unitary causal operator. By causal we mean that information can only propagate at a bounded…
The (disjoint) fort number and fractional zero forcing number are introduced and related to existing parameters including the (standard) zero forcing number. The fort hypergraph is introduced and hypergraph results on transversals and…
In this paper we study integer multiplicity rectifiable currents carried by the subgradient (subdifferential) graphs of semi-convex functions on a $n$-dimensional convex domain, and show a weak continuity theorem with respect to pointwise…
We introduce regular series expansion for weakly- and moderately-correlated fermionic systems, based on Fluctuating Local Field approach. The method relies on the explicit account of leading fluctuating mode(s) and is therefore suitable for…
On sparse graphs, Roditty and Williams [2013] proved that no $O(n^{2-\varepsilon})$-time algorithm achieves an approximation factor smaller than $\frac{3}{2}$ for the diameter problem unless SETH fails. In this article, we solve an open…
We study the statistical properties of the scattering matrix associated with generic quantum graphs. The scattering matrix is the quantum analogue of the classical evolution operator on the graph. For the energy-averaged spectral form…
The focus of this article is to develop computationally efficient mathematical morphology operators on hypergraphs. To this aim we consider lattice structures on hypergraphs on which we build morphological operators. We develop a pair of…
I discuss the behaviour of algorithms for dynamical fermions as the sea-quark mass decreases. I focus on the Hybrid-Monte-Carlo (HMC) algorithm applied to two degenerate flavours of Wilson fermions. First, I briefly review the performance…
A multi-factor extension of the Hobson and Rogers (HR) model, incorporating a quadratic variance function (QHR model), is proposed and analysed. The QHR model allows for greater flexibility in defining the moving average filter while…
We introduce the Hidden Polynomial Function Graph Problem as a natural generalization of an abelian Hidden Subgroup Problem (HSP) where the subgroups and their cosets correspond to graphs of linear functions over the finite field F_p. For…
Graph clustering is a fundamental technique in data analysis with applications in many different fields. While there is a large body of work on clustering undirected graphs, the problem of clustering directed graphs is much less understood.…
Let $\K$ be a field and $(f_1, \ldots, f_n)\subset \K[X_1, \ldots, X_n]$ be a sequence of quasi-homogeneous polynomials of respective weighted degrees $(d_1, \ldots, d_n)$ w.r.t a system of weights $(w_{1},\dots,w_{n})$. Such systems are…
We initiate the combinatorial study of factorization systems on finite lattices, paying special attention to the role that reflective and coreflective factorization systems play in partitioning the poset of factorization systems on a fixed…
Few changes. We compute the Hilbert series of some algebras associated to directed graphs and related to factorizations of noncommutative polynomials.
We study Cayley graphs of abelian groups from the perspective of quantum symmetries. We develop a general strategy for determining the quantum automorphism groups of such graphs. Applying this procedure, we find the quantum symmetries of…
Solvable vertex models in statistical mechanics give rise to soliton cellular automata at q=0 in a ferromagnetic regime. By means of the crystal base theory we study a class of such automata associated with non-exceptional quantum affine…