Ludwig Rahm
This paper defines the algebraic structure of tracial post-Lie-Rinehart algebras and describes the free object in this category. Post-Lie-Rinehart algebras is a generalisation of pre-Lie-Rinehart algebras, and of post-Lie algebroids.
Menampilkan 20 dari ~2083902 hasil · dari arXiv, DOAJ, CrossRef
Ludwig Rahm
This paper defines the algebraic structure of tracial post-Lie-Rinehart algebras and describes the free object in this category. Post-Lie-Rinehart algebras is a generalisation of pre-Lie-Rinehart algebras, and of post-Lie algebroids.
Dora Woodruff
We give a pattern-avoidance characterization of $w \in S_n$ such that the Schubert polynomial $\mathfrak{S}_w$ is a standard elementary monomial. This characterization tells us which quantum Schubert polynomials are easiest to compute. We solve a similar problem for complete homogeneous monomials.
Dragomir Ž. Djoković
Our main result is the construction of symmetric Hadamard matrices of order q(1 + q) where q is a prime power congruent to 3 mod 8.
Qian Yu, Yaoping Hou
In this paper, we determine all connected net-regular strongly regular signed graphs with degree 5. There are five and two strongly regular signed graphs with net-degree 3 and 1, respectively.
Ivan Hetman
In this paper new Steiner systems $S(2,6,111)$, $S(2,6,121)$, $S(2,6,126)$, $S(2,7,169)$, $S(2,7,175)$ and possibly others with point-transitive (commutative except $S(2,6,111)$ case) automorphism groups are introduced.
Anonymous
Dmitrii Taletskii
We show that the number of independent sets in every outerplanar graph is greater than the number of its 4-dominating sets.
Jetze Zoethout
AbstractWe consider two preorder-enriched categories of ordered partial combinatory algebras: OPCA, where the arrows are functional (i.e., projective) morphisms, and OPCA†, where the arrows are applicative morphisms. We show that OPCA has small products and finite biproducts, and that OPCA† has finite coproducts, all in a suitable 2-categorical sense. On the other hand, OPCA† lacks all nontrivial binary products. We deduce from this that the pushout, over Set, of two nontrivial realizability toposes is never a realizability topos. In contrast, we show that nontrivial subtoposes of realizability toposes are closed under pushouts over Set.
Helmut Prodinger
S-Motzkin paths (bijective to ternary trees) and partial version of them are calculated using only elementary methods from linear algebra.
Kunle Adegoke
We prove some identities for the squares of generalized Tribonacci numbers. Various summation identities involving these numbers are derived.
Roland Bacher
We introduce and study a subring $\mathcal{SC}$ of $\mathbb Z[\mathrm{SL}\_2(\mathbb F\_q)]$ obtained by summing elements of $\mathrm{SL}\_2(\mathbb F\_q)$ according to their support. The ring $\mathcal SC$ can be used for the construction of several association schemes.
D Riglioni, O Gingras, P Winternitz
Pete L. Clark
We revisit and further explore the celebrated Combinatorial Nullstellensätze of N. Alon in several different directions.
Shi-Mei Ma
The purpose of this paper is to show that Bessel polynomials, double factorials and Catalan triangle can be generated by using context-free grammars.
Juergen Bierbrauer, William M. Kantor
Simple constructions are given for finite semifields that include as special cases both old semifields and recently constructed semifields.
Hirotake Kurihara, Hiroshi Nozaki
We prove a necessary and sufficient condition for a symmetric association scheme to be a Q-polynomial scheme.
K. Kopotun, D. Leviatan, I. A. Shevchuk
Mateusz Michalek
In this note we give a short, direct proof of the well known Combinatorial Nullstellensatz.
Rishi Nath
Using only a symmetric p-core partition and p-quotient, we give an explicit formula for the set of diagonal hook lengths of the associated symmetric partition.
Jan Malý, David Swanson, William Ziemer
We extend Federer’s co-area formula to mappings f f belonging to the Sobolev class W 1 , p ( R n ; R m ) W^{1,p}(\mathbb {R}^n;\mathbb {R}^m) , 1 ≤ m > n 1 \le m > n , p > m p>m , and more generally, to mappings with gradient in the Lorentz space L m , 1 ( R n ) L^{m,1}(\mathbb {R}^n) . This is accomplished by showing that the graph of f f in R n + m \mathbb {R}^{n+m} is a Hausdorff n n -rectifiable set.
Halaman 42 dari 104196