Related papers: A note on the Weiss conjecture
The famous strongly binary Goldbach's conjecture asserts that every even number $2n \geq 8$ can always be expressible as the sum of two distinct odd prime numbers. We use a new approach to dealing with this conjecture. Specifically, we…
We formulate a stability conjecture for the coefficients of the colored Jones polynomial of a knot, colored by irreducible representations in a fixed ray of a simple Lie algebra, and verify it for all torus knots and all simple Lie algebras…
We propose a new approach to study plethysm coefficients by using the Schur-Weyl duality between the symmetric group and the partition algebra. This allows us to explain the stability properties of plethysm and Kronecker coefficients in a…
We study in general algebras Gratzer's notion of congruence preserving function, characterizing functions in terms of stability under inverse image of particular Boolean algebras of subsets generated from any subset of the algebra.…
The purpose of the present paper is to discuss the following conjecture of Fel'shtyn and Hill, which is a generalization of the classical Burnside theorem: Let G be a countable discrete group, f its automorphism, R(f) the number of…
The Bost conjecture with C*-algebra coefficients for locally compact Hausdorff groups passes to open subgroups. We also prove that if a locally compact Hausdorff group acts on a tree, then the Bost conjecture with C*-coefficients is true…
This paper presents some considerations about the Goldbach's conjecture (GC). The work is based on elementary results of the number theory and it provides a constructive method that permits, given an even integer, to find at least a pair of…
We provide two candidates for symplectic Weiss calculus based on two different, but closely related, collections of groups. In the case of the non-compact symplectic groups, i.e., automorphism groups of vector spaces with symplectic forms,…
The Union Closed Sets Conjecture is one of the most renowned problems in combinatorics. Its appeal lies in the simplicity of its statement contrasted with the potential complexity of its resolution. The conjecture posits that, in any union…
Let $G$ be a group acting by homeomorphisms on a Hausdorff compact space $Z$. We constructed a new space $X$ that blows up equivariantly the bounded parabolic points of $Z$. This means, roughly speaking, that $G$ acts by homeomorphisms on…
Wu, Zhang and Li [4] conjectured that the set of vertices of any simple graph $G$ can be equitably partitioned into $\lceil(\Delta(G)+1)/2\rceil$ subsets so that each of them induces a forest of $G$. In this note, we prove this conjecture…
Let $G$ be a transitive permutation group on a finite set $\Omega$ and recall that a base for $G$ is a subset of $\Omega$ with trivial pointwise stabiliser. The base size of $G$, denoted $b(G)$, is the minimal size of a base. If $b(G)=2$…
In this note we show that for analytic semigroups the so-called Weiss condition of uniform boundedness of the operators $Re(\lambda)^\einhalb C(\lambda+A)^{-1}, \qquad Re(\lambda)>0$ on the complex right half plane and weak Lebesgue…
A dominating set in a graph $G$ is a set $S$ of vertices such that every vertex of $G$ is either in $S$ or is adjacent to a vertex in $S$. Nordhaus-Gaddum inequailties relate a graph $G$ to its complement $\bar{G}$. In this spirit Wagner…
In this paper we continue the study of group representations which are counterexamples to the Ize conjecture. As in the previous papers by Lauterbach [14] and Lauterbach & Matthews [15] we find new infinite series of finite groups leading…
Suppose a finite, unweighted, combinatorial graph $G = (V,E)$ is the union of several (degree-)regular graphs which are then additionally connected with a few additional edges. $G$ will then have only a small number of vertices $v \in V$…
The commuting graph of a group $G$ is the graph whose vertices are the elements of $G$, two distinct vertices joined if they commute. Our purpose in this paper is twofold: we discuss the computational problem of deciding whether a given…
For a finite connected simple graph, the Terwilliger algebra is a matrix algebra generated by the adjacency matrix and idempotents corresponding to the distance partition with respect to a fixed vertex. We will consider algebras defined by…
Previously, Biggs has conjectured that the resistance between any two points on a distance-regular graph of valency greater than 2 is bounded by twice the resistance between adjacent points. We prove this conjecture, give the sharp constant…
Working in any model theoretic structure, we single out a class of definable bipartite graphs that admit definable, close to perfect matchings. We use this result to prove a strengthening of Tarski's theorem for the definable setting.