English
Related papers

Related papers: Semigraphoids Are Two-Antecedental Approximations …

200 papers

The semigroup $\mathbf{I}\mathbb{N}_{\infty}$ of all partial co-finite isometries of positive integers is studied. We describe Green's relations on the semigroup $\mathbf{I}\mathbb{N}_{\infty}$, its band and proved that…

Group Theory · Mathematics 2019-04-16 Oleg Gutik , Anatolii Savchuk

Let $i_t(G)$ be the number of independent sets of size $t$ in a graph $G$. Alavi, Erd\H{o}s, Malde and Schwenk made the conjecture that if $G$ is a tree then the independent set sequence $\{i_t(G)\}_{t\geq 0}$ of $G$ is unimodal; Levit and…

Combinatorics · Mathematics 2012-06-27 David Galvin

Causal graphs (CGs) are compact representations of the knowledge of the data generating processes behind the data distributions. When a CG is available, e.g., from the domain knowledge, we can infer the conditional independence (CI)…

Machine Learning · Computer Science 2021-08-18 Takeshi Teshima , Masashi Sugiyama

The fundamental concepts underlying in Markov networks are the conditional independence and the set of rules called Markov properties that translates conditional independence constraints into graphs. In this article we introduce the concept…

Methodology · Statistics 2016-03-14 Niharika Gauraha

In Generalised Bayesian Inference (GBI), the learning rate and hyperparameters of the loss must be estimated. These inference-hyperparameters can't be estimated jointly with the other parameters, from the data, by giving them a prior.…

Methodology · Statistics 2026-05-18 Jeong Eun Lee , Sitong Liu , Geoff K. Nicholls

We show that every finite semilattice can be represented as an atomized semilattice, an algebraic structure with additional elements (atoms) that extend the semilattice's partial order. Each atom maps to one subdirectly irreducible…

Rings and Algebras · Mathematics 2021-02-17 Fernando Martin-Maroto , Gonzalo G. de Polavieja

We introduce the notion of pattern for numerical semigroups, which allows us to generalize the definition of Arf numerical semigroups. In this way infinitely many other classes of numerical semigroups are defined giving a classification of…

Rings and Algebras · Mathematics 2019-12-10 Maria Bras-Amorós , Pedro García-Sánchez

Here, a separation theorem about Independent Subspace Analysis (ISA), a generalization of Independent Component Analysis (ICA) is proven. According to the theorem, ISA estimation can be executed in two steps under certain conditions. In the…

Statistics Theory · Mathematics 2007-06-13 Zoltan Szabo , Barnabas Poczos , Andras Lorincz

Bi-intuitionistic logic is the conservative extension of intuitionistic logic with a connective dual to implication. It is sometimes presented as a symmetric constructive subsystem of classical logic. In this paper, we compare three sequent…

Logic in Computer Science · Computer Science 2011-01-31 Luís Pinto , Tarmo Uustalu

Graphs derived from groups are a widely studied class of graphs, motivated by their highly symmetric structure. In particular, G-graphs offer an easy and interesting alternative construction of semi-symmetric graphs. After recalling the…

Combinatorics · Mathematics 2016-11-25 David Ellison , Ruxandra Marinescu-Ghemeci , Cerasela Tanasescu

In graphical modelling, a bi-directed graph encodes marginal independences among random variables that are identified with the vertices of the graph. We show how to transform a bi-directed graph into a maximal ancestral graph that (i)…

Statistics Theory · Mathematics 2008-03-25 Mathias Drton , Thomas S. Richardson

Semiconic idempotent logic sCI is a common generalization of intuitionistic logic, semilinear idempotent logic sLI, and in particular relevance logic with mingle. We establish the projective Beth definability property and the deductive…

Logic · Mathematics 2023-07-21 Wesley Fussner , Nick Galatos

Word-representable graphs, characterized by the existence of a semi-transitive orientation, form a well-studied class of graphs. Comparability graphs form another well-studied class and constitute a subclass of word-representable graphs.…

Discrete Mathematics · Computer Science 2026-05-15 Benny George Kenkireth , Gopalan Sajith , Sreyas Sasidharan

Given a group $G$ and a subset $X \subset G$, an element $g \in G$ is called quasi-positive if it is equal to a product of conjugates of elements in the semigroup generated by $X$. This notion is important in the context of braid groups,…

Group Theory · Mathematics 2019-01-30 Robert W. Bell , Rita Gitik

We improve on earlier results on the closure under free products of the class of automaton semigroups. We consider partial automata and show that the free product of two self-similar semigroups (or automaton semigroups) is self-similar (an…

Group Theory · Mathematics 2025-09-01 Tara Macalister Brough , Jan Philipp Wächter , Janette Welker

When a category is equipped with a 2-cell structure it becomes a sesquicategory but not necessarily a 2-category. It is widely accepted that the latter property is equivalent to the middle interchange law. However, little attention has been…

Category Theory · Mathematics 2024-06-13 Nelson Martins-Ferreira

Semifields are semirings in which every nonzero element has a multiplicative inverse. A rough classification uses the characteristic of the semifield, that is the isomorphism type of the semifield generated by the two neutral elements. For…

Algebraic Geometry · Mathematics 2017-09-21 Guillaume Tahar

We consider 6-manifolds endowed with a symplectic half-flat SU(3)-structure and acted on by a transitive Lie group G of automorphisms. We review a classical result allowing to show the non-existence of compact non-flat examples. In the…

Differential Geometry · Mathematics 2025-01-03 Fabio Podestà , Alberto Raffero

Semi-implicit variational inference (SIVI) is introduced to expand the commonly used analytic variational distribution family, by mixing the variational parameter with a flexible distribution. This mixing distribution can assume any density…

Machine Learning · Statistics 2018-05-30 Mingzhang Yin , Mingyuan Zhou

We provide a general and syntactically-defined family of sequent calculi, called \emph{semi-analytic}, to formalize the informal notion of a "nice" sequent calculus. We show that any sufficiently strong (multimodal) substructural logic with…

Logic in Computer Science · Computer Science 2024-09-04 Amirhossein Akbar Tabatabai , Raheleh Jalali
‹ Prev 1 3 4 5 6 7 10 Next ›