English
Related papers

Related papers: Partially Palindromic Compositions

200 papers

Given integers $a_1, a_2, ..., a_n$, with $a_1 + a_2 + ... + a_n \geq 1$, a symmetrically constrained composition $\lambda_1 + lambda_2 + ... + lambda_n = M$ of $M$ into $n$ nonnegative parts is one that satisfies each of the the $n!$…

Combinatorics · Mathematics 2013-11-08 Matthias Beck , Ira M. Gessel , Sunyoung Lee , Carla D. Savage

Computational effects are commonly modelled by monads, but often a monad can be presented by an algebraic theory of operations and equations. This talk is about monads and algebraic theories for languages for inference, and their…

Logic in Computer Science · Computer Science 2023-12-29 Cristina Matache , Sean Moss , Sam Staton , Ariadne Si Suo

Properties of partial integrals such as real and complex-valued polynomial, multiple polynomial, exponential, and conditional for ordinary differential systems are studied. The possibilities of constructing first integrals and last…

Classical Analysis and ODEs · Mathematics 2018-09-20 V. N. Gorbuzov

We study the compositional inverses of some general classes of permutation polynomials over finite fields. We show that we can write these inverses in terms of the inverses of two other polynomials bijecting subspaces of the finite field,…

Number Theory · Mathematics 2013-11-01 Aleksandr Tuxanidy , Qiang Wang

We study the structure of symplectic quandles, quandles which are also R-modules equipped with an antisymmetric bilinear form. We show that every finite dimensional symplectic quandle over a finite field F or arbitrary field F of…

Quantum Algebra · Mathematics 2007-09-20 Esteban Adam Navas , Sam Nelson

We survey structures endowed with natural partial orderings and prove their universality. These partial orders include partial orders on sets of words, partial orders formed by geometric objects, grammars, polynomials and homomorphism order…

Combinatorics · Mathematics 2013-02-07 Jaroslav Nesetril , Jan Hubicka

We estimate the frequency of singular matrices and of matrices of a given rank whose entries are parametrised by arbitrary polynomials over the integers and modulo a prime $p$. In particular, in the integer case, we improve a recent bound…

Number Theory · Mathematics 2023-10-20 Ali Mohammadi , Alina Ostafe , Igor Shparlinski

The present paper records more details of the relationship between primitive elements and palindromes in F_2, the free group of rank two. We characterise the conjugacy classes of primitive elements which contain palindromes as those which…

Group Theory · Mathematics 2019-02-07 Adam Piggott

We introduce two classes of morphisms over the alphabet $A=\{0,1\}$ whose fixed points contain infinitely many antipalindromic factors. An antipalindrome is a finite word invariant under the action of the antimorphism…

Combinatorics · Mathematics 2019-06-17 Petr Ambrož , Zuzana Masáková , Edita Pelantová

Reversible systems feature both forward computations and backward computations, where the latter undo the effects of the former in a causally consistent manner. The compositionality properties and equational characterizations of strong and…

Logic in Computer Science · Computer Science 2023-10-03 Marco Bernardo , Andrea Esposito

Recently, several bounds have been obtained on the number of solutions to congruences of the type $$ (x_1+s)...(x_{\nu}+s)\equiv (y_1+s)...(y_{\nu}+s)\not\equiv0 \pmod p $$ modulo a prime $p$ with variables from some short intervals. Here,…

Number Theory · Mathematics 2012-10-25 Jean Bourgain , Moubariz Z. Garaev , Sergei V. Konyagin , Igor E. Shparlinski

This text is a presentation (without proofs) of some of my recent results on the singular terms of asymptotic expansions of period-integrals using (a,b)-modules. I try to explain why this simple algebraic structure is interesting and…

Algebraic Geometry · Mathematics 2024-03-21 Daniel Barlet

In this paper we investigate the complexity-theoretical aspects of cyclic and non-wellfounded proofs in the context of parsimonious logic, a variant of linear logic where the exponential modality ! is interpreted as a constructor for…

Logic in Computer Science · Computer Science 2025-09-12 Matteo Acclavio , Gianluca Curzi , Giulio Guerrieri

We identify computability-theoretic properties enabling us to separate various statements about partial orders in reverse mathematics. We obtain simpler proofs of existing separations, and deduce new compound ones. This work is part of a…

Logic · Mathematics 2016-12-14 Ludovic Patey

We give extensions of results on nonnegative matrix semigroups which deduce finiteness or boundedness of such semigroups from the corresponding local properties, e.g., from finiteness or boundedness of values of certain linear functionals…

Functional Analysis · Mathematics 2013-07-01 Roman Drnovšek , Heydar Radjavi

We present a number of results relating partial Cauchy-Littlewood sums, integrals over the compact classical groups, and increasing subsequences of permutations. These include: integral formulae for the distribution of the longest…

Combinatorics · Mathematics 2007-05-23 Jinho Baik , Eric M. Rains

We identify the semigroups consisting of bounded composition operators on the Hardy spaces $H^p(\U)$ of the upper half-plane. We show that any such semigroup is strongly continuous on $H^p(\U)$ but not uniformly continuous and we identify…

Functional Analysis · Mathematics 2011-09-27 Athanasios G. Arvanitidis

A polynomial is called self-reciprocal (or palindromic) if the sequence of its coefficients is palindromic. In this paper we enumerate self-reciprocal irreducible monic polynomials over a finite field with prescribed leading coefficients.…

Combinatorics · Mathematics 2021-10-14 Zhicheng Gao

The partition function is known to exhibit beautiful congruences that are often proved using the theory of modular forms. In this paper, we study the extent to which these congruence results apply to the generalized Frobenius partitions…

Number Theory · Mathematics 2018-09-05 Marie Jameson , Maggie Wieczorek

If $S$ is a cofinite set of positive integers, an "$S$-restricted composition of $n$" is a sequence of elements of $S$, denoted $\vec{\lambda}=(\lambda_1,\lambda_2,...)$, whose sum is $n$. For uniform random $S$-restricted compositions, the…

Combinatorics · Mathematics 2012-03-13 Eric Schmutz , Caroline Shapcott
‹ Prev 1 3 4 5 6 7 10 Next ›