Related papers: Avoidability of circular formulas

Comtet introduced the notion of indecomposable permutations in 1972. A permutation is indecomposable if and only if it has no proper prefix which is itself a permutation. Indecomposable permutations were studied in the literature in various…

Classical pattern avoidance and occurrence are well studied in the symmetric group $\mathcal{S}_{n}$. In this paper, we provide explicit recurrence relations to the generating functions counting the number of classical pattern occurrence in…

For a graph (undirected, directed, or mixed), a cycle-factor is a collection of vertex-disjoint cycles covering the entire vertex set. Cycle-factors subject to parity constraints arise naturally in the study of structural graph theory and…

Many proposed applications of neural networks in machine learning, cognitive/brain science, and society hinge on the feasibility of inner interpretability via circuit discovery. This calls for empirical and theoretical explorations of…

An effective upper bound is established for the least non-trivial integer solution to the system of cubic forms \[ \begin{cases} F = c_{1}x_1^3 + c_{2}x_2^3 + \cdots + c_{n}x_n^3 = 0, \\ G = d_{1}x_1^3 + d_{2}x_2^3 + \cdots + d_{n}x_n^3 =…

A classification is given of certain separable nuclear C*-algebras not necessarily of real rank zero, namely, the class of separable simple C*-algebras which are inductive limits of continuous-trace C*-algebras whose building blocks have…

This paper deals with the problem of evaluating the causal effect using observational data in the presence of an unobserved exposure/ outcome variable, when cause-effect relationships between variables can be described as a directed acyclic…

Erd\"os conjectured the existence of an infinite Sidon sequence of positive integers which is also an asymptotic basis of order 3. We make progress towards this conjecture in several directions. First we prove the conjecture for all cyclic…

The author's idea of {\it algebraic compositeness} of fundamental particles, allowing to understand the existence in Nature of three fermion generations, is revisited. It is based on two postulates. i) For all fundamental particles of…

In the set of all patterns in $S_n$, it is clear that each k-pattern occurs equally often. If we instead restrict to the class of permutations avoiding a specific pattern, the situation quickly becomes more interesting. Mikl\'os B\'ona…

Let ${\rm rad}(n)$ denote the product of distinct prime factors of an integer $n\geq 1$. The celebrated $abc$ conjecture asks whether every solution to the equation $a+b=c$ in triples of coprime integers $(a,b,c)$ must satisfy ${\rm…

Computing the complexity of Markov bases is an extremely challenging problem; no formula is known in general and there are very few classes of toric ideals for which the Markov complexity has been computed. A monomial curve $C$ in…

A computationally simple approach to inference in state space models is proposed, using approximate Bayesian computation (ABC). ABC avoids evaluation of an intractable likelihood by matching summary statistics for the observed data with…

We study the two dual notions of prime avoidance and prime absorbance. We generalize the classical prime avoidance lemma to radical ideals. A number of new criteria are provided for an abstract ring to be C.P. (every set of primes satisfies…

A permutation $\pi$ is said to avoid a chain $(\sigma:\tau)$ of patterns if $\pi$ avoids $\sigma$ and $\pi^2$ avoids $\tau.$ In this paper, we define a notion of pattern avoidance for compositions of positive integers and use that idea to…

Permutations that avoid given patterns are among the most classical objects in combinatorics and have strong connections to many fields of mathematics, computer science and biology. In this paper we study fixed points of both 123- and…

A circular word, or a necklace, is an equivalence class under conjugation of a word. A fundamental question concerning regularities in standard words is bounding the number of distinct squares in a word of length $n$. The famous conjecture…

A subset $U$ of a set $S$ with a binary operation is called {\it avoidable} if $S$ can be partitioned into two subsets $A$ and $B$ such that no element of $U$ can be written as a product of two distinct elements of $A$ or as the product of…

Given a point S and any irreducible algebraic curve C in P^2 (with any type of singularities), we consider the caustic of reflection defined as the Zariski closure of the envelope of the reflected lines from the point S on the curve C. We…

Abductive forgetting is removing variables from a logical formula while maintaining its abductive explanations. It is carried in two alternative ways depending on its intended application. Both differ from the usual forgetting, which…