Related papers: On the Rearrangement Conjecture for Generalized Fa…
The Delta Conjecture of Haglund, Remmel, and Wilson is a recent generalization of the Shuffle Conjecture in the field of diagonal harmonics. In this paper we give evidence for the Delta Conjecture by proving a pair of conjectures of Wilson…
In this article, I focus on the resiliency of the P=?NP problem. The main point to deal with is the change of the underlying logic from first to second-order logic. In this manner, after developing the initial steps of this change, I can…
We introduce a generalization of Pascal triangle based on binomial coefficients of finite words. These coefficients count the number of times a word appears as a subsequence of another finite word. Similarly to the Sierpi\'nski gasket that…
Within classical propositional logic, assigning probabilities to formulas is shown to be equivalent to assigning probabilities to valuations. A novel notion of probabilistic entailment enjoying desirable properties of logical consequence is…
A factor $u$ of a word $w$ is a cover of $w$ if every position in $w$ lies within some occurrence of $u$ in $w$. A word $w$ covered by $u$ thus generalizes the idea of a repetition, that is, a word composed of exact concatenations of $u$.…
A combinatorial formula of G.-C. Rota and J.A. Stein is taken to perform Wick re-ordering in quantum field theory. Wick's theorem becomes a Hopf algebraic identity called Cliffordization. The combinatorial method relying on Hopf algebras is…
We introduce a strong form of Oliver's p-group conjecture and derive a reformulation in terms of the modular representation theory of a quotient group. The Sylow p-subgroups of the symmetric group S_n and of the general linear group…
Starting with a likelihood or preference order on worlds, we extend it to a likelihood ordering on sets of worlds in a natural way, and examine the resulting logic. Lewis (1973) earlier considered such a notion of relative likelihood in the…
Descents in permutations or words are defined from the relative position of two consecutive letters. We investigate a statistic involving patterns of k consecutive letters, and show that it leads to Hopf algebras generalizing noncommutative…
The Pascal matrix, $P$, is an upper diagonal matrix whose entries are the binomial coefficients. In 1993 Call and Velleman demonstrated that it satisfies the beautiful relation $P=\exp(H)$ in which $H$ has the numbers 1, 2, 3, etc. on its…
Usually, probabilistic automata and probabilistic grammars have crisp symbols as inputs, which can be viewed as the formal models of computing with values. In this paper, we first introduce probabilistic automata and probabilistic grammars…
If w is a word in d>1 letters and G is a finite group, evaluation of w on a uniformly randomly chosen d-tuple in G gives a random variable with values in G, which may or may not be uniform. It is known that if G ranges over finite simple…
We generalize the study of standard Lyndon loop words from [A.Negut, A.Tsymbaliuk, "Quantum loop groups and shuffle algebras via Lyndon words", Adv. Math. 439 (2024), Paper No. 109482] to a more general class of orders on the underlying…
Driven by the interest of reasoning about probabilistic programming languages, we set out to study a notion of unicity of normal forms for them. To provide a tractable proof method for it, we define a property of distribution confluence…
We consider questions related to the structure of infinite words (over an integer alphabet) with bounded additive complexity, i.e., words with the property that the number of distinct sums exhibited by factors of the same length is bounded…
A famous conjecture of Graham asserts that every set $A \subseteq \mathbb{Z}_p \setminus \{0\}$ can be ordered so that all partial sums are distinct. Bedert and Kravitz proved that this statement holds whenever $|A| \leq e^{c(\log…
We consider word maps and word maps with constants on a simple algebraic group. We present results on the images of such maps, in particular, we prove a theorem on the dominance of general word maps with constants, which can be viewed as an…
Some polynomials $P$ with rational coefficients give rise to well defined maps between cyclic groups, $\Z_q\longrightarrow\Z_r$, $x+q\Z\longmapsto P(x)+r\Z$. More generally, there are polynomials in several variables with tuples of rational…
In the previous author's paper the Macdonald norm conjecture (including the famous constant term conjecture) was proved. This paper contains the proof of the remaining two (the duality and evaluation conjectures). The evaluation theorem is…
We investigate the quantifier alternation hierarchy in first-order logic on finite words. Levels in this hierarchy are defined by counting the number of quantifier alternations in formulas. We prove that one can decide membership of a…