English
Related papers

Related papers: Odd number and Trapezoidal number

200 papers

Using the notion of existentially closed structures, we obtain embedding theorems for groups and Lie algebras. We also prove the existence of some groups and Lie algebras with prescribed properties.

Group Theory · Mathematics 2014-05-07 M. Shahryari

In this article we prove a reciprocity law in number fields with odd class number that specializes to Scholz's reciprocity law over the rationals.

Number Theory · Mathematics 2021-01-11 Franz Lemmermeyer

We previously extended the Marsden-Ratiu reduction theorem in Poisson geometry by means of graded geometry (see Part I of Arxiv:1009.0948) . In this note we provide the background material about graded geometry necessary for the proof.…

Symplectic Geometry · Mathematics 2020-03-13 Alberto S. Cattaneo , Marco Zambon

In this paper we prove that the nonzero elements of a finite field with odd characteristic can be partitioned into pairs with prescribed difference (maybe, with some alternatives) in each pair. The algebraic and topological approaches to…

Combinatorics · Mathematics 2011-03-14 R. N. Karasev , F. V. Petrov

We prove equidistribution of two pairs of statistics on boxed plane partitions: (volume, trace) and (corner-hook volume, number of corners). The proof relies on different 3d visualizations of the corresponding non-intersecting path systems.…

Combinatorics · Mathematics 2026-05-15 Alimzhan Amanov , Damir Yeliussizov

We define a fragment of monadic infinitary second-order logic corresponding to an abstract separation property. We use this to define the concept of a separation subclass. We use model theoretic techniques and games to show that separation…

Logic · Mathematics 2021-12-09 Rob Egrot

In this article, we define and study a geometry and an order on the set of partitions of an even number of objects. One of the definitions involves the partition algebra, a structure of algebra on the set of such partitions depending on an…

Combinatorics · Mathematics 2016-11-01 Franck Gabriel

We will investigate proof-theoretic and linguistic aspects of first-order linear logic. We will show that adding partial order constraints in such a way that each sequent defines a unique linear order on the antecedent formulas of a sequent…

Logic in Computer Science · Computer Science 2020-08-17 Richard Moot

This short note reports a master theorem on tight asymptotic solutions to divide-and-conquer recurrences with more than one recursive term: for example, T(n) = 1/4 T(n/16) + 1/3 T(3n/5) + 4 T(n/100) + 10 T(n/300) + n^2.

General Literature · Computer Science 2007-05-23 Ming-Yang Kao

In this expository note, I present some of the key features of the lattice of torsion classes of a finite-dimensional algebra, focussing in particular on its complete semidistributivity and consequences thereof. This is intended to serve as…

Representation Theory · Mathematics 2021-02-18 Hugh Thomas

These lecture notes explain the construction and basic properties of the wonderful compactification of a complex semisimple group of adjoint type. An appendix discusses the more general case of a semisimple symmetric space.

Algebraic Geometry · Mathematics 2008-01-04 Sam Evens , Benjamin F Jones

There are significant differences between Helmholtz and Hodge's decomposition theorems, but both share a common flavor. This paper is a first step to bring them together. We here produce Helmholtz theorems for differential 1-forms and…

General Mathematics · Mathematics 2014-04-22 Jose G. Vargas

Let $p_{o}(n)$ (resp. $p_{e}(n)$) denote the number of partitions of $n$ with more odd parts (resp. even parts) than even parts (resp. odd parts). Recently, Kim, Kim, and Lovejoy proved that $p_{o}(n)>p_{e}(n)$ for all $n>2$ and conjectured…

In this lecture notes we try to familiarize the audience with the theory of Bernoulli polynomials; we study their properties, and we give, with proofs and references, some of the most relevant results related to them. Several applications…

Classical Analysis and ODEs · Mathematics 2016-02-10 Omran Kouba

Building on the concept of pretentious multiplicative functions, we give a new and largely elementary proof of the best result known on the counting function of primes in arithmetic progressions.

Number Theory · Mathematics 2019-02-20 Dimitris Koukoulopoulos

This is an expository article to accompany my two lectures at the CDM conference. I have used this an excuse to make public two sets of notes I had lying around, and also to put together a short reader's guide to some recent joint work with…

Number Theory · Mathematics 2007-10-04 Ben Green

We show that the number of anti-lecture hall compositions of n with the first entry not exceeding k-2 equals the number of overpartitions of n with non-overlined parts not congruent to $0,\pm 1$ modulo k. This identity can be considered as…

Combinatorics · Mathematics 2010-06-22 William Y. C. Chen , Doris D. M. Sang , Diane Y. H. Shi

In this paper, we study classes of subexcedant functions enumerated by the Bell numbers and present bijections on set partitions. We present a set of permutations whose transposition arrays are the restricted growth functions, thus defining…

Combinatorics · Mathematics 2022-08-23 Fufa Beyene , Jörgen Backelin , Roberto Mantaci , Samuel A. Fufa

We generalize the well known Glaisher partition bijection result. For given positive integers n, d, both greater than 1, we provide a rich family of bijections between the set of partitions of n where at least one part is divisible by d,…

Combinatorics · Mathematics 2020-03-19 Aritro Pathak

There has been always an ambiguity in division when zero is present in the denominator. So far this ambiguity has been neglected by assuming that division by zero as a non-allowed operation. In this paper, I have derived the new set of…

General Mathematics · Mathematics 2011-07-07 Mohd Abubakr