相关论文: Decimation and Interleaving Operations in One-Side…

Absence of (complex) zeros property is at the heart of the interpolation method developed by Barvinok \cite{barvinok2017combinatorics} for designing deterministic approximation algorithms for various graph counting and computing partition…

We define a notion of (one-sided) shift spaces over infinite alphabets. Unlike many previous approaches to shift spaces over countable alphabets, our shift spaces are compact Hausdorff spaces. We examine shift morphisms between these shift…

Let $A\subseteq B$ be a ring extension and $\mathcal{G}$ be a set of $A$-submodules of $B$. We introduce a class of closure operations on $\mathcal{G}$ (which we call \emph{multiplicative operations on $(A,B,\mathcal{G})$}) that generalizes…

Building on the work of Grinberg and Stanley, we begin a systematic study of permutations with a prescribed $X$-descent set. In particular, for a set $X \subseteq \mathbb{N}^2$, and $I \subseteq [n-1]$, we study the permutations $\pi \in…

We describe the defect operator interpretation of the supersymmetric Renyi entropies of superconformal field theories in three, four and five dimensions. The operators involved are supersymmetric codimension-two defects in an auxiliary Z_n…

Given Hilbert space operators $A_i, B_i$, $i=1,2$, and $X$ such that $A_1$ commutes with $A_2$ and $B_!$ commutes with $B_2$, and integers $m, n\geq 1$, we say that the pairs of operators $(B_1,A_1)$ and $(B_2,A_2)$ are left-$(X,…

Soft sets, as a mathematical tool for dealing with uncertainty, have recently gained considerable attention, including some successful applications in information processing, decision, demand analysis, and forecasting. To construct new soft…

Let $X$ be a finite set and let $\mathsf{Mat}_X(\mathbb{C})$ denote the algebra of matrices with rows and columns indexed by $X$ and entries from the complex numbers acting on $\mathbb{C}^X$ with standard basis $\{ \hat{x} \mid x\in X\}$.…

This paper introduces the notion of involution module, the first generalization of the modular decomposition of 2-structure which has a unique linear-sized decomposition tree. We derive an O(n^2) decomposition algorithm and we take…

In this work, we revisit several families of standard Hamiltonians that appear in the literature and discuss their symmetries and conserved quantities in the language of commutant algebras. In particular, we start with families of…

Let $X$ be an irreducible shift of finite type (SFT) of positive entropy, and let $B_n(X)$ be its set of words of length $n$. Define a random subset $\omega$ of $B_n(X)$ by independently choosing each word from $B_n(X)$ with some…

We extend the symbolic representation to the ring of N=1 supersymmetric differential polynomials, and demonstrate that operations on the ring, such as the super derivative, Frechet derivative and super commutator, can be carried out in the…

For a pair $(G,G')=(O(n+1,1), O(n,1))$ of reductive groups, we investigate intertwining operators (symmetry breaking operators) between principal series representations $I_\delta(V,\lambda)$ of $G$, and $J_\epsilon(W,\nu)$ of the subgroup…

We consider the problem of storing a dynamic string $S$ over an alphabet $\Sigma=\{\,1,\ldots,\sigma\,\}$ in compressed form. Our representation supports insertions and deletions of symbols and answers three fundamental queries:…

Morphisms are homomorphisms under the concatenation operation of the set of words over a finite set. Changing the elements of the finite set does not essentially change the morphism. We propose a way to select a unique representing member…

Some quantum field theories show, in a fundamental or an effective manner, an alternative between a loss of duality for algebras of operators corresponding to complementary regions, or a loss of additivity. In this latter case, the algebra…

We study an extension of the Distributive Full Non-associative Lambek Calculus with iterative division operators. The iterative operators can be seen as representing iterative composition of linguistic resources or of actions. A complete…

In this work, we study fixed point algorithms for finding a zero in the sum of $n\geq 2$ maximally monotone operators by using their resolvents. More precisely, we consider the class of such algorithms where each resolvent is evaluated only…

We completely solve ergodic optimization of a full shift with an uncountable alphabet $[0,1]$, which is one of the most well-known examples of infinite dimensional dynamical systems with positive mean dimension (and thus with infinite…

Functional digraphs are unlabelled finite digraphs where each vertex has exactly one out-neighbor. They are isomorphic classes of finite discrete-time dynamical systems. Endowed with the direct sum and product, functional digraphs form a…