相关论文: Chains of affine standard Lyndon words
Splint of root system of simple Lie algebra appears naturally in the study of (regular) embeddings of reductive subalgebras. It can be used to derive branching rules. Application of splint properties drastically simplifies calculations of…
Lifted Reed-Solomon codes are a natural affine-invariant family of error-correcting codes which generalize Reed-Muller codes. They were known to have efficient local-testing and local-decoding algorithms (comparable to the known algorithms…
I extend the framework of rigid analytic geometry to the setting of algebraic geometry relative to monoids, and study the associated notions of separated, proper, and overconvergent morphisms. The category of affine manifolds embeds as a…
In this paper, we explore applications of combinatorics on words across various domains, including data compression, error detection, cryptographic protocols, and pseudorandom number generation. The examination of the theoretical…
We consider finite trees with edges labeled by letters on a finite alphabet $\varSigma$. Each pair of nodes defines a unique labeled path whose trace is a word of the free monoid $\varSigma^*$. The set of all such words defines the language…
Efficient computation of trajectories of switched affine systems becomes possible, if for any such hybrid system, we can manage to efficiently compute the sequence of switching times. Once the switching times have been computed, we can…
We consider the set of finite random words $\mathcal A^\star$, with independent letters drawn from a finite or infinite totally ordered alphabet according to a general probability distribution. On a specific subset of $\mathcal A^\star$,…
We generalize the familiar notion of periodicity in sequences to a new kind of pseudoperiodicity, and we prove some basic results about it. We revisit the results of a 2012 paper of Shevelev and reprove his results in a simpler and more…
Previous work has shown that the disarray (or displacement) of an (affine) (signed) permutation is bounded in terms of its Coxeter length. Here, we characterize the permutations for which the bound is sharp in two ways: in terms of a…
The affine group of a tree is the group of the isometries of a homogeneous tree that fix an end of its boundary. Consider a probability measure on this group and the associated random walk. The main goal of this paper is to determine the…
In this paper, we study a Lienard system of the form dot{x}=y-F(x), dot{y}=-x, where F(x) is an odd polynomial. We introduce a method that gives a sequence of algebraic approximations to the equation of each limit cycle of the system. This…
The process of sorting the suffixes of a text plays a fundamental role in Text Algorithms. They are used for instance in the constructions of the Burrows-Wheeler transform and the suffix array, widely used in several fields of Computer…
In this note we present a characterisation of all unary and binary patterns that do not only contain variables, but also reversals of their instances. These types of variables were studied recently in either more general or particular…
Affine $\lambda$-terms are $\lambda$-terms in which each bound variable occurs at most once and linear $\lambda$-terms are $\lambda$-terms in which each bound variables occurs once. and only once. In this paper we count the number of closed…
In this note, after recalling a proof of the Macdonald identities for untwisted affine root systems, we derive the Macdonald identities for twisted affine root systems.
This article describes a method for constructing approximations to periodic solutions of dynamic Lorenz system with classical values of the system parameters. The author obtained a system of nonlinear algebraic equations in general form…
While the currents of the defocusing Ablowitz-Ladik chain are unambiguously defined, no explicit formulas for their densities have been obtained yet. We close this gap. As a consequence, we also complete the argument which establishes the…
The notion of inverse Lyndon word is related to the classical notion of Lyndon word. More precisely, inverse Lyndon words are all and only the nonempty prefixes of the powers of the anti-Lyndon words, where an anti-Lyndon word with respect…
We present the formalization of a theory of syntax with bindings that has been developed and refined over the last decade to support several large formalization efforts. Terms are defined for an arbitrary number of constructors of varying…
An enumerative problem on a variety $V$ is usually solved by reduction to intersection theory in the cohomology of a compactification of $V$. However, if the problem is invariant under a "nice" group action on $V$ (so that $V$ is…