Related papers: Idempotent means on free binary systems do not exi…
A complete extension theorem for linear codes over a module alphabet and the symmetrized weight composition is proved. It is shown that an extension property with respect to arbitrary weight function does not hold for module alphabets with…
We prove that the additive group of the rationals does not have an automatic presentation. The proof also applies to certain other abelian groups, for example, torsion-free groups that are $p$-divisible for infinitely many primes $p$, or…
In this paper, we develop the notion of free-Boolean independence in an amalgamation setting. We construct free-Boolean cumulants and show that the vanishing of mixed free-Boolean cumulants is equivalent to our free-Boolean independence…
We develop infinite-dimensional Ramsey theory for Fra\"iss\'e limits of finitely constrained free amalgamation classes in finite binary languages. We show that our approach is optimal and in particular, recovers the exact big Ramsey degrees…
We introduce a noncommutative binary operation on matroids, called free product. We show that this operation respects matroid duality, and has the property that, given only the cardinalities, an ordered pair of matroids may be recovered, up…
We consider a system of $N$ pairwise interacting particles described by the Hamiltonian $H$, where $\sigma_{ess} (H) = [0,\infty)$ and none of the particle pairs has a zero energy resonance. The pair potentials are allowed to take both…
The concept of parity check matrices of linear binary codes has been extended by Heden [9] to parity check systems of nonlinear binary codes. In the present paper we extend this concept to parity check systems of nonlinear codes over finite…
In this article, we study a class of fully nonlinear double-divergence systems with free boundaries associated with a minimization problem. The variational structure of Hessian-dependent functional plays a fundamental role in proving the…
In this paper we use the Lyndon-Shirshov basis to study the shuffle type polynomials. We give a free noncommutative binomial (or multinomial) theorem in terms of the Lyndon-Shirshov basis. Another noncommutative binomial theorem given by…
We characterize the squares occurring in infinite overlap-free binary words and construct various alpha power-free binary words containing infinitely many overlaps.
In a central lemma we characterize "generating functions" of certain functors on the category of algebraic non-commutative probability spaces. Special families of such generating functions correspond to "unital, associative universal…
We show that the sum of two free random variables can have a free Poisson law without any of them having a free Poisson law.
This note considers the finite linear independence of coherent systems associated to discrete subgroups. We show by simple arguments that such coherent systems of amenable groups are linearly independent whenever the associated twisted…
We consider a binary system of small and large spheres of finite size in a continuous medium interacting via a non-negative potential. We work in the canonical ensemble and compute upper and lower bound for the free energy at finite and…
We consider a Hamiltonian system of free boundary type, showing first uniform bounds and existence of solutions and of the free boundary. Then, for any smooth and bounded domain, we prove uniqueness of positive solutions in a suitable…
Let M, N be free modules over a Noetherian commutative ring R and let F be a field such that card(F) does not exceed the continuum. Then : (1) The assertion that [Any two F-vector spaces with isomorphic duals are isomorphic] is equivallent…
Recently there has been much interest and progress in extending the definition of contextuality to systems with disturbance. We prove that such an endeavor cannot simultaneously satisfy the following principles: (1) any deterministic system…
We introduce an embedding of the free magma on a set A into the direct product of the free magma on a singleton set and the free semigroup on A. This embedding is then used to prove several theorems related to algebraic independence of…
Exact ground truth invariant polynomial systems can be written for arbitrarily correlated binary classifiers. Their solutions give estimates for sample statistics that require knowledge of the ground truth of the correct labels in the…
In this paper, we introduce the notion of conditionally bi-free independence in an amalgamated setting. We define operator-valued conditionally bi-multiplicative pairs of functions and construct operator-valued conditionally bi-free moment…