English
Related papers

Related papers: Commuting degree for BCK-algebras

200 papers

We construct a graph of Kummer elements in a given cyclic algebra of prime degree and study its properties. In case of degree 5, we provide sufficient conditions for two elements to have a chain of Kummer elements connecting them, such that…

Rings and Algebras · Mathematics 2014-07-11 Adam Chapman

We propose the following conjecture extending Dirac's theorem: if $G$ is a graph with $n\ge 3$ vertices and minimum degree $\delta(G)\ge n/2$, then in every orientation of $G$ there is a Hamilton cycle with at least $\delta(G)$ edges…

Combinatorics · Mathematics 2023-03-13 Lior Gishboliner , Michael Krivelevich , Peleg Michaeli

We investigate the joint distribution of the vertex degrees in three models of random bipartite graphs. Namely, we can choose each edge with a specified probability, choose a specified number of edges, or specify the vertex degrees in one…

Combinatorics · Mathematics 2022-12-22 Brendan D. McKay , Fiona Skerman

We formulate the transition from decelerated to accelerated expansion as a bounce in connection space and study its quantum cosmology, knowing that reflections are notorious for bringing quantum effects to the fore. We use a formalism for…

General Relativity and Quantum Cosmology · Physics 2023-01-18 Steffen Gielen , João Magueijo

For an infinite chain bicomplex we show that the orthogonality and grading conditions provide it with the structure of a bigraded differential algebra with respect to a natural multiplication of several elements bicomplex spaces.…

Functional Analysis · Mathematics 2023-12-12 A. Zuevsky

We recall the derived subalgebra of a BCK-algebra, and use this to define the derived ideal. Using the derived ideal, we show that the category of commutative BCK-algebras is a reflective subcategory of the category of BCK-algebras. After…

Rings and Algebras · Mathematics 2025-12-24 C. Matthew Evans

For a finite group G, we study the higher commuting probabilities, namely the probabilities that r randomly chosen elements of G commute pairwise, together with the corresponding numbers of simultaneous conjugacy classes of commuting…

Group Theory · Mathematics 2026-05-05 Vadim E. Levit , Robert Shwartz

We introduce a sorting machine consisting of $k+1$ stacks in series: the first $k$ stacks can only contain elements in decreasing order from top to bottom, while the last one has the opposite restriction. This device generalizes \cite{SM},…

Data Structures and Algorithms · Computer Science 2019-10-10 Giulio Cerbai , Lapo Cioni , Luca Ferrari

Consider a simple random walk on the integers with the following transition mechanism. At each site $x$, the probability of jumping to the right is $\omega(x)\in[\frac12,1)$, until the first time the process jumps to the left from site $x$,…

Probability · Mathematics 2015-05-13 Ross Pinsky

Let $G$ be an algebraic group. For $d\geq 1$, we define the commuting probabilities $cp_d(G) = \frac{dim(\mathfrak C_d(G))}{dim(G^d)}$, where $\mathfrak C_d(G)$ is the variety of commuting $d$-tuples in $G$. We prove that for a reductive…

Group Theory · Mathematics 2021-05-28 Shripad M. Garge , Uday Bhaskar Sharma , Anupam Singh

The Buchsbaum-Eisenbud-Horrocks rank conjecture proposes lower bounds for the Betti numbers of a graded module M based on the codimension of M. We prove a special case of this conjecture via Boij-Soederberg theory. More specifically, we…

Commutative Algebra · Mathematics 2018-04-30 Daniel Erman

In this note we consider the $k$th level of the uniform random recursive tree after $n$ steps, and prove that the proportion of nodes with degree greater than $t\log n$ converges to $(1-t)^k$ almost surely, as $n\to\infty$, for every…

Probability · Mathematics 2011-12-07 Ágnes Backhausz , Tamás F. Móri

We consider the conjugation-action of an arbitrary upper-block parabolic subgroup of the general linear group on the variety of nilpotent matrices in its Lie algebra. Lie-theoretically, it is natural to wonder about the number of orbits of…

Representation Theory · Mathematics 2019-02-28 Magdalena Boos , Michaël Bulois

Coalescing random walk on a unimodular random rooted graph for which the root has finite expected degree visits each site infinitely often almost surely. A corollary is that an opinion in the voter model on such graphs has infinite expected…

Probability · Mathematics 2018-04-06 Eric Foxall , Tom Hutchcroft , Matthew Junge

For a graph $G$, let $c_k(G)$ be the number of spanning trees of $G$ with maximum degree at most $k$. For $k \ge 3$, it is proved that every connected $n$-vertex $r$-regular graph $G$ with $r \ge \frac{n}{k+1}$ satisfies $$ c_k(G)^{1/n} \ge…

Combinatorics · Mathematics 2022-08-01 Raphael Yuster

One of the main concepts in quantum physics is a density matrix, which is a symmetric positive definite matrix of trace one. Finite probability distributions are a special case where the density matrix is restricted to be diagonal. Density…

Quantum Physics · Physics 2014-08-14 Manfred K. Warmuth , Dima Kuzmin

We find sharp upper and lower bounds for the degree of an algebraic number in terms of the $Q$-dimension of the space spanned by its conjugates. For all but seven nonnegative integers $n$ the largest degree of an algebraic number whose…

Number Theory · Mathematics 2007-05-23 Neil Berry , Arturas Dubickas , Noam D. Elkies , Bjorn Poonen , Chris Smyth

Consider a scenario where a quantum particle is initially prepared in some bounded region of space and left to propagate freely. After some time, we verify if the particle has reached some distant target region. We find that there exist…

Quantum Physics · Physics 2023-09-27 David Trillo , Thinh P. Le , Miguel Navascues

Consider a random bipartite multigraph $G$ with $n$ left nodes and $m \geq n \geq 2$ right nodes. Each left node $x$ has $d_x \geq 1$ random right neighbors. The average left degree $\Delta$ is fixed, $\Delta \geq 2$. We ask whether for the…

Discrete Mathematics · Computer Science 2012-04-30 Martin Dietzfelbinger , Michael Rink

The (strong) Bruhat order for permutations provides a partial ordering defined as follows: two permutations are comparable if one can be obtained from the other by a sequence of adjacent transpositions that each increase the number of…

Combinatorics · Mathematics 2026-02-19 Nicholas Christo , Marcus Michelen
‹ Prev 1 3 4 5 6 7 10 Next ›