相关论文: Effective Computation of Generalized Abelian Compl…

An important combinatorial result in equivariant cohomology and $K$-theory Schubert calculus is represented by the formulas of Billey and Graham-Willems for the localization of Schubert classes at torus fixed points. These formulas work…

This paper describes an alternative method of generating fixed points of certain substitution systems. This method centres on taking infinite words consisting of one repeated letter per word. These infinite words are then interlaced to form…

G. Rauzy showed that the Tribonacci minimal subshift generated by the morphism $\tau: 0\mapsto 01, 1\mapsto 02 and 2\mapsto 0$ is measure-theoretically conjugate to an exchange of three fractal domains on a compact set in $R^2$, each domain…

Let $A$ be abelian variety over the function field $K$ of a compact Riemann surface $B$. Fix a model $f \colon \mathcal{A} \to B$ of $A/K$ and a certain effective horizontal divisor $\DD \subset \mathcal{A}$. We give a sufficient condition…

We consider an Abel polynomial differential equation. For two given points a and b, the "Poincare mapping" of the equation transforms the values of its solution at a into their values at b. In this article, we study global analytic…

The article presents several methods for the arithmetic of finite abelian groups. We introduce a tool - already used by Delsarte in [1] as I found out later - analogous to Dirichlet's convolution to obtain combinatorial results on these…

Abelian codes and complementary dual codes form important classes of linear codes that have been extensively studied due to their rich algebraic structures and wide applications. In this paper, a family of abelian codes with complementary…

Using the Okounkov-Maulik stable map, we identify the equivariant cohomology of instanton moduli spaces with the space of polynomials on an infinite number of variables. We define the generalized Jack polynomials as the polynomials…

We study substitutive systems generated by nonprimitive substitutions and show that transitive subsystems of substitutive systems are substitutive. As an application we obtain a complete characterisation of the sets of words that can appear…

We study the Borel complexity of sets of normal numbers in several numeration systems. Taking a dynamical point of view, we offer a unified treatment for continued fraction expansions and base $r$ expansions, and their various…

We consider Abelian extensions of global symmetries of the form $A \to G \to K$, with $A$ finite (and similar higher-group structures). For a quantum field theory $\mathcal{T}$ with symmetry $G$, we compare gauging $G$ directly with gauging…

A generalized 1-in-3SAT problem is defined and found to be in complexity class P when restricted to a certain subset of CNF expressions. In particular, 1-in-kSAT with no restrictions on the number of literals per clause can be decided in…

We show that the subword complexity function p_x(n), which counts the number of distinct factors of length n of a sequence x, is k-synchronized in the sense of Carpi if x is k-automatic. As an application, we generalize recent results of…

We prove by using simple number-theoretic arguments formulae concerning the number of elements of a fixed order and the number of cyclic subgroups of a direct product of several finite cyclic groups. We point out that certain multiplicative…

This paper establishes the equivalence of the Aubin property and the strong regularity for generalized equations over $C^2$-cone reducible sets. This result resolves a long-standing question in variational analysis and extends the…

We define a theory of parameterized algebraic complexity classes in analogy to parameterized Boolean counting classes. We define the classes VFPT and VW[t], which mirror the Boolean counting classes #FPT and #W[t], and define appropriate…

The paper explores combinatorial properties of Fibonacci words and their generalizations within the framework of combinatorics on words. These infinite sequences, measures the diversity of subwords in Fibonacci words, showing non-decreasing…

A set of valuable universal similarity factorization equalities is established over complex Clifford algebras $\Cn.$ Through them matrix representations of complex Clifford algebras $\Cn$ can directly be derived, and their properties can…

We begin by considering faithful matrix representations of elementary abelian groups in prime characteristic. The representations considered are seen to be determined up to change of bases by a single number. Studying this number leads to a…

Two finite words are k-binomially equivalent if each subword (i.e., subsequence) of length at most k occurs the same number of times in both words. The k-binomial complexity of an infinite word is a function that maps the integer $n\geq 0$…