Results 31 to 40 of about 15,294 (116)

Hypergraph Unreliability in Quasi-Polynomial Time [PDF]

open access: yesSymposium on the Theory of Computing
The hypergraph unreliability problem asks for the probability that a hypergraph gets disconnected when every hyperedge fails independently with a given probability.
Ruoxu Cen, Jason Li, D. Panigrahi
semanticscholar   +1 more source

Decomposing tournaments into paths

open access: yesProceedings of the London Mathematical Society, Volume 121, Issue 2, Page 426-461, August 2020., 2020
Abstract We consider a generalisation of Kelly's conjecture which is due to Alspach, Mason, and Pullman from 1976. Kelly's conjecture states that every regular tournament has an edge decomposition into Hamilton cycles, and this was proved by Kühn and Osthus for large tournaments. The conjecture of Alspach, Mason, and Pullman asks for the minimum number
Allan Lo   +3 more
wiley   +1 more source

Quasi-regular representations of discrete groups and associated $C^*$-algebras [PDF]

open access: yesTransactions of the American Mathematical Society, 2019
Let $G$ be a countable group. We introduce several equivalence relations on the set ${\rm Sub}(G)$ of subgroups of $G$, defined by properties of the quasi-regular representations $\lambda_{G/H}$ associated to $H\in {\rm Sub}(G)$ and compare them to the ...
Bachir Bekka, Mehrdad Kalantar
semanticscholar   +1 more source

Double Domination and Regular Domination in Intuitionistic Fuzzy Hypergraph

open access: yesJournal of mathematics, 2022
This study investigates the domination, double domination, and regular domination in intuitionistic fuzzy hypergraph (IFHG), which has enormous application in computer science, networking, chemical, and biological engineering.
P. Sri   +3 more
semanticscholar   +1 more source

Quasi Regular Modules and Trivial Extension

open access: yes, 2020
Recall that a ring R is said to be a quasi regular ring if its total quotient ring q(R) is  von Neumann regular. It is well known that a ring R is quasi regular iff it is a reduced  ring satisfying the property: for each a \in R, ann(ann(a)) = ann(b) for
C. Jayaram, Ünsal Teki̇r, Suat Koç
semanticscholar   +1 more source

Regular swimming exercise improves metabolic syndrome risk factors: a quasi-experimental study

open access: yesBMC Sports Science, Medicine and Rehabilitation, 2021
Background In the past few decades, swimming became one of the most important physical activities within the health system and is considered a practical nonpharmacological approach to managing of type 2 diabetes (T2DM), hyperlipidemia, hypertension (HTN),
J. Omar   +3 more
semanticscholar   +1 more source

A Universal Meta‐Heuristic Framework for Influence Maximisation in Hypergraphs

open access: yesCAAI Transactions on Intelligence Technology, Volume 11, Issue 2, Page 396-410, April 2026.
ABSTRACT Influence maximisation (IM) aims to select a small number of nodes that are able to maximise their influence in a network and covers a wide range of applications. Despite numerous attempts to provide effective solutions in simple networks, higher‐order interactions between entities in various real‐world systems are usually not taken into ...
Ming Xie   +5 more
wiley   +1 more source

f$f$‐Diophantine sets over finite fields via quasi‐random hypergraphs from multivariate polynomials

open access: yesMathematika, Volume 72, Issue 2, April 2026.
Abstract We investigate f$f$‐Diophantine sets over finite fields via new explicit constructions of families of quasi‐random hypergraphs from multivariate polynomials. In particular, our construction not only offers a systematic method for constructing quasi‐random hypergraphs but also provides a unified framework for studying various hypergraphs ...
Seoyoung Kim, Chi Hoi Yip, Semin Yoo
wiley   +1 more source

Toward Useful Quantum Kernels

open access: yesAdvanced Quantum Technologies, Volume 8, Issue 12, December 2025.
The hybrid approach to Quantum Supervised Machine Learning is compatible with Noisy Intermediate Scale Quantum (NISQ) devices but hardly useful. Pure quantum kernels requiring fault‐tolerant quantum computers are more promising. Examples are kernels computed by means of the Quantum Fourier Transform (QFT) and kernels defined via the calculation of ...
Massimiliano Incudini   +2 more
wiley   +1 more source

Complete characterisation of Kronecker invariants of a matrix pencil with a prescribed quasi-regular subpencil

open access: yes, 2020
In this paper, the possible Kronecker invariants of a matrix pencil with a prescribed quasi-regular subpencil are determined.
Marija Dodig
semanticscholar   +1 more source

Home - About - Disclaimer - Privacy