Results 101 to 110 of about 169,932 (295)
Completing Multi‐Latin Rectangles via Factors With Prescribed Degrees in Bipartite Graphs
Journal of Combinatorial Designs, Volume 34, Issue 1, Page 31-36, January 2026.ABSTRACT Let Q be an n × n array whose top left r × s sub‐array L is filled with a set of k different symbols such that each cell of L contains λ symbols. In this note, we find conditions under which each empty cell of Q can be filled with λ symbols in such a way that the total number of occurrences of each symbol is prescribed and that each symbol ...
Amin Bahmanian
wiley +1 more source
ABA and the combinatorics of morphological features
, 2018 In several three cell paradigms, it has been observed that one logically conceivable pattern – ABA under some arrangement of cells – is unattested. Existing approaches assume that such *ABA generalizations provide evidence for feature inventories which ...
J. Bobaljik, U. Sauerland
semanticscholar +1 more source
New Difference Triangle Sets by a Field‐Programmable Gate Array‐Based Search Technique
Journal of Combinatorial Designs, Volume 34, Issue 1, Page 37-50, January 2026.ABSTRACT We provide some difference triangle sets with scopes that improve upon the best known values. These are found with purpose‐built digital circuits realized with field‐programmable gate arrays (FPGAs) rather than software algorithms running on general‐purpose processors.
Mohannad Shehadeh +2 more
wiley +1 more source
Ore's theorem on subfactor planar algebras
, 2019 This article proves that an irreducible subfactor planar algebra with a distributive biprojection lattice admits a minimal 2-box projection generating the identity biprojection.
Palcoux, Sebastien
core
JTAM (Jurnal Teori dan Aplikasi Matematika)Rainbow vertex antimagic coloring is a novel concept in graph theory that combines rainbow vertex connection with antimagic labeling. Rainbow vertex connection is a vertex coloring where each vertex in a simple connected graph G=(V,E) is connected by a ...
Dafik Dafik +5 more
doaj +1 more source
Polynomially oscillatory multipliers on Gelfand–Shilov spaces
Mathematische Nachrichten, Volume 299, Issue 1, Page 35-59, January 2026.Abstract We study continuity of the multiplier operator eiq$\text{e}^{\text{i} q}$ acting on Gelfand–Shilov spaces, where q$q$ is a polynomial on Rd$\mathbf {R}^{d}$ of degree at least two with real coefficients. In the parameter quadrant for the spaces, we identify a wedge that depends on the polynomial degree for which the operator is continuous.
Alexandre Arias Junior, Patrik Wahlberg
wiley +1 more source
On the Stability Barrier of Hermite Type Discretizations of Advection Equations
Numerical Methods for Partial Differential Equations, Volume 42, Issue 1, January 2026.ABSTRACT We establish a stability barrier for a class of high‐order Hermite‐type discretization of 1D advection equations underlying the hybrid‐variable (HV) and active flux (AF) methods. These methods approximate both cell averages and nodal solutions and evolve them in time simultaneously.
Xianyi Zeng
wiley +1 more source
Conflict-Free Vertex-Connections of Graphs
Discussiones Mathematicae Graph Theory, 2020 A path in a vertex-colored graph is called conflict-free if there is a color used on exactly one of its vertices. A vertex-colored graph is said to be conflict-free vertex-connected if any two vertices of the graph are connected by a conflict-free path ...
Li Xueliang +5 more
doaj +1 more source
A Refined Graph Container Lemma and Applications to the Hard‐Core Model on Bipartite Expanders
Random Structures &Algorithms, Volume 68, Issue 1, January 2026.ABSTRACT We establish a refined version of a graph container lemma due to Galvin and discuss several applications related to the hard‐core model on bipartite expander graphs. Given a graph G$$ G $$ and λ>0$$ \lambda >0 $$, the hard‐core model on G$$ G $$ at activity λ$$ \lambda $$ is the probability distribution μG,λ$$ {\mu}_{G,\lambda } $$ on ...
Matthew Jenssen +2 more
wiley +1 more source
Rainbow Connection Number of Dense Graphs
Discussiones Mathematicae Graph Theory, 2013 An edge-colored graph G is rainbow connected, if any two vertices are connected by a path whose edges have distinct colors. The rainbow connection number of a connected graph G, denoted rc(G), is the smallest number of colors that are needed in order to ...
Li Xueliang +2 more
doaj +1 more source