English
Related papers

Related papers: Weak Heffter Arrays and biembedding graphs on non-…

200 papers

We introduce a new extragradient iterative process, motivated and inspired by [S. H. Khan, A Picard-Mann Hybrid Iterative Process, Fixed Point Theory and Applications, doi:10.1186/1687-1812-2013-69], for finding a common element of the set…

Functional Analysis · Mathematics 2014-03-14 Ibrahim Karahan , Murat Ozdemir

We investigate weakly $G$-slim complexes, a more flexible variant of Helfer and Wise's slim complexes, which can be defined on any regular $G$-covering. We prove that if a $2$-complex $X$ associated to a group presentation is weakly…

Group Theory · Mathematics 2025-06-25 Agustín Nicolás Barreto , Elias Gabriel Minian

The theories of (Hopf) bialgebras and weak (Hopf) bialgebras have been introduced for vector space categories over fields and make heavily use of the tensor product. As first generalisations, these notions were formulated for monoidal…

Category Theory · Mathematics 2016-04-21 Bachuki Mesablishvili , Robert Wisbauer

Weak superimposed codes are combinatorial structures related closely to generalized cover-free families, superimposed codes, and disjunct matrices in that they are only required to satisfy similar but less stringent conditions. This class…

Information Theory · Computer Science 2024-09-17 Yu Tsunoda , Yuichiro Fujiwara

The aim of this paper is to define and study Yetter-Drinfeld modules over weak Hom-Hopf algebras. We show that the category ${}_H{\cal WYD}^H$ of Yetter-Drinfeld modules with bijective structure maps over weak Hom-Hopf algebras is a rigid…

Rings and Algebras · Mathematics 2016-03-01 Shuangjian Guo , Yizheng Li , Shengxiang Wang

For an $n$-tuple $s$ of non-negative integers, the $s$-weak order is a lattice structure on $s$-trees, generalizing the weak order on permutations. We first describe the join irreducible elements, the canonical join representations, and the…

Combinatorics · Mathematics 2025-12-08 Eva Philippe , Vincent Pilaud

In this paper we introduce a general notion of weak extension property for embeddings induced by a group actions. As an example, for the group H(M, m) of measure-preserving homeomorphisms of a noncompact manifold M, we deduce weak type…

Geometric Topology · Mathematics 2009-04-09 Tatsuhiko Yagasaki

Given an $r$-uniform hypergraph $H$ and a positive integer $n$, the weak saturation number $\mathrm{wsat}(n,H)$ is the minimum number of edges in an $r$-uniform hypergraph $F$ on $n$ vertices such that the missing edges in $F$ can be added,…

Combinatorics · Mathematics 2026-04-09 Nikolai Terekhov

By omitting the unitary constraint from the definition of weak post-Hopf algebras, we introduce the concept of relaxed weak post-Hopf algebras, offering a thorough characterization of all feasible relaxed weak post-Hopf algebraic structures…

Rings and Algebras · Mathematics 2025-07-29 Chen Quanguo

The weak tensor product was introduced by Snevily as a way to construct new graphs that admit $\alpha$-labelings from a pair of known $\alpha$-graphs. In this article, we show that this product and the application to $\alpha$-labelings can…

Combinatorics · Mathematics 2014-08-01 Susana-Clara López , Francesc-Antoni Muntaner-Batle

A weak value is an effective description of the influence of a pre and post-selected 'principal' system on another 'meter' system to which it is weakly coupled. Weak values can describe anomalously large deflections of the meter, and…

Quantum Physics · Physics 2018-08-13 George C. Knee , G. Andrew D. Briggs

We investigate the representations and the structure of Hecke algebras associated to certain finite complex reflection groups. We first describe computational methods for the construction of irreducible representations of these algebras,…

Representation Theory · Mathematics 2019-02-20 Gunter Malle , Jean Michel

The adjacency matrix is the most fundamental and intuitive object in graph analysis that is useful not only mathematically but also for visualizing the structures of graphs. Because the appearance of an adjacency matrix is critically…

Social and Information Networks · Computer Science 2023-04-07 Tatsuro Kawamoto , Teruyoshi Kobayashi

Graph representation learning (also called graph embeddings) is a popular technique for incorporating network structure into machine learning models. Unsupervised graph embedding methods aim to capture graph structure by learning a…

Social and Information Networks · Computer Science 2022-01-24 Andrew Stolman , Caleb Levy , C. Seshadhri , Aneesh Sharma

In this article, we propose to initiate the general study of involution systems. An {\em involution system}, that is, a group $W$ generated by a set of involutions $S$, is naturally endowed with a {\em weak order} arising from orienting the…

Group Theory · Mathematics 2026-04-22 Fabricio Dos Santos , Christophe Hohlweg , Aleksandr Trufanov

As generalizations of skew left braces, weak left braces were introduced recently by Catino, Mazzotta, Miccoli and Stefanelli to study ceratin special degenerate set-theoretical solutions of the Yang-Baxter equation. In this note, as…

Group Theory · Mathematics 2025-02-24 Shoufeng Wang

Graph representation learning models aim to represent the graph structure and its features into low-dimensional vectors in a latent space, which can benefit various downstream tasks, such as node classification and link prediction. Due to…

Machine Learning · Computer Science 2023-04-27 Thanh Sang Nguyen , Jooho Lee , Van Thuy Hoang , O-Joun Lee

We construct a `weak' version EM^w(K) of Lack & Street's 2-category of monads in a 2-category K, by replacing their compatibility constraint of 1-cells with the units of monads by an additional condition on the 2-cells. A relation between…

Category Theory · Mathematics 2012-01-27 Gabriella Böhm

In this paper we develop a general theory of metric Diophantine approximation for systems of linear forms. A new notion of `weak non-planarity' of manifolds and more generally measures on the space of $m\times n$ matrices over $\Bbb R$ is…

Number Theory · Mathematics 2013-10-21 Victor Beresnevich , Dmitry Kleinbock , Gregory Margulis

We introduce and study a notion of cylinder coherator similar to the notion of Grothendieck coherator which define more flexible notion of weak infinity groupoids. We show that each such cylinder coherator produces a combinatorial…

Category Theory · Mathematics 2016-09-16 Simon Henry