English
Related papers

Related papers: Another characterization of congruence distributiv…

200 papers

Matrix congruence can be used to mimic linear maps between homogeneous quadratic polynomials in $n$ variables. We introduce a generalization, called standard-form congruence, which mimics affine maps between non-homogeneous quadratic…

Rings and Algebras · Mathematics 2018-09-19 Jason Gaddis

We establish tight lower and upper bounds on the number of edges in traceable graphs in several classes of dense graphs. A graph is traceable if it has a Hamiltonian path. We show that the bound is: - quadratic for the class of graphs of…

Combinatorics · Mathematics 2025-09-03 Michal Dvořák , Dušan Knop , Michal Opler , Jan Pokorný , Ondřej Suchý , Krisztina Szilágyi

Let $n$ be a positive integer, $\sigma$ be an element of the symmetric group $\mathcal{S}_n$ and let $\sigma$ be a cycle of length $n$. The elements $\alpha ,\beta \in \mathcal{S}_n$ are $\sigma$-equivalent, if there are natural numbers $k$…

Combinatorics · Mathematics 2014-10-31 Krasimir Yordzhev

For a class V of algebras, denote by Conc(V) the class of all semilattices isomorphic to the semilattice Conc(A) of all compact congruences of A, for some A in V. For classes V1 and V2 of algebras, we denote by crit(V1,V2) the smallest…

Rings and Algebras · Mathematics 2009-03-05 Pierre Gillibert

We analyse the structure of imprecise Markov chains and study their convergence by means of accessibility relations. We first identify the sets of states, so-called minimal permanent classes, that are the minimal sets capable of containing…

Probability · Mathematics 2016-09-20 Damjan Skulj

A graph $\Gamma = (V,E)$ of order $n$ is {\em distance magic} if it admits a bijective labeling $\ell \colon V \to \{1,2, \ldots, n\}$ of its vertices for which there exists a positive integer $\kappa$ such that $\sum_{u \in N(v)} \ell(u) =…

Combinatorics · Mathematics 2024-12-09 Štefko Miklavič , Primož Šparl

Let $\Gamma$ be the fundamental group of a finite connected graph $\mathcal G$. Let $\mathfrak M$ be an abelian group. A {\it distribution} on the boundary $\partial\Delta$ of the universal covering tree $\Delta$ is an $\mathfrak M$-valued…

Group Theory · Mathematics 2013-02-25 Guyan Robertson

Let $G$ be a semiabelian variety defined over an algebraically closed field $K$ of prime characteristic. We describe the intersection of a subvariety $X$ of $G$ with a finitely generated subgroup of $G(K)$.

Number Theory · Mathematics 2023-06-07 Dragos Ghioca , She Yang

Let $\Gamma=(V,E)$ be a simple graph. For a nonempty set $X\subseteq V$, and a vertex $v\in V$, $\delta_{X}(v)$ denotes the number of neighbors $v$ has in $X$. A nonempty set $S\subseteq V$ is a \emph{defensive $k$-alliance} in…

Combinatorics · Mathematics 2010-03-26 J. A. Rodriguez , J. M. Sigarreta

Let k be an algebraically closed field of characteristic p > 0. Let H be a subgroup of GL(n,k). We are interested in the determination of the vector invariants of H. When the characteristic of k is 0, it is known that the invariants of d…

Commutative Algebra · Mathematics 2007-05-23 Frank D. Grosshans

The aim of this paper is to give a precise asymptotic description of some eigenvalue statistics stemming from random matrix theory. More precisely, we consider random determinants of the GUE, Laguerre, Uniform Gram and Jacobi beta ensembles…

Probability · Mathematics 2017-07-25 Martina Dal Borgo , Emma Hovhannisyan , Alain Rouault

Let H\subset\GL(V) be a connected complex reductive group where V is a finite-dimensional complex vector space. Let v\in V and let G=\{g\in\GL(V)\mid gHv = Hv\}. Following Ra\"is we say that the orbit Hv is \emph{characteristic for H} if…

Representation Theory · Mathematics 2010-11-04 Gerald W. Schwarz

We prove a conjecture of Courcelle, which states that a graph property is definable in MSO with modular counting predicates on graphs of constant treewidth if, and only if it is recognizable in the following sense: constant-width tree…

Logic in Computer Science · Computer Science 2016-05-11 Mikołaj Bojańczyk , Michał Pilipczuk

We give a necessary and sufficient condition for symmetric infinitely divisible distribution to have Gaussian component. The result can be applied to approximation the distribution of finite sums of random variables. Particularly, it shows…

Probability · Mathematics 2015-08-25 Lev B. Klebanov , Irina V. Volchenkova , Ashot V. Kakosyan

A nonsingular real algebraic variety Y is said to have the approximation property if for every real algebraic variety X the following holds: if f:X-->Y is a C^inf map that is homotopic to a regular map, then f can be approximated in the…

Algebraic Geometry · Mathematics 2024-07-23 Juliusz Banecki , Wojciech Kucharz

Let K be the symmetric convex hull of m independent random vectors uniformly distributed on the unit sphere of R^n. We prove that, for every $\delta>0$, the isotropy constant of K is bounded by a constant $c(\delta)$ with high probability,…

Metric Geometry · Mathematics 2007-07-12 David Alonso-Gutierrez

We denote by Conc(A) the semilattice of compact congruences of an algebra A. Given a variety V of algebras, we denote by Conc(V) the class of all semilattices isomorphic to Conc(A) for some A in V. Given varieties V1 and V2 varieties of…

Category Theory · Mathematics 2010-07-28 Pierre Gillibert

The existence of invariant generators for distributions satisfying a compatibility condition with the symmetry algebra is proved.

Differential Geometry · Mathematics 2011-10-17 Madeleine Jotz , Tudor S. Ratiu

The stability of the Ghurye-Olkin (GO) characterization of Gaussian vectors is analyzed using a partition of the vectors into equivalence classes defined by their matrix factors. The sum of the vectors in each class is near-Gaussian in the…

Information Theory · Computer Science 2025-10-07 Mahdi Mahvari , Gerhard Kramer

We provide a characterization of upper locally distributive lattices (ULD-lattices) in terms of edge colorings of their cover graphs. In many instances where a set of combinatorial objects carries the order structure of a lattice this…

Combinatorics · Mathematics 2008-07-09 S. Felsner , K. Knauer