English
Related papers

Related papers: A new Boolean matrix representation for Catalan se…

200 papers

Exponential integrators based on contour integral representations lead to powerful numerical solvers for a variety of ODEs, PDEs, and other time-evolution equations. They are embarrassingly parallelizable and lead to global-in-time…

Numerical Analysis · Mathematics 2024-11-15 Andrew Horning , Adam R. Gerlach

In this paper, we discuss modules and structures of the planar upper triangular rook monoid B_n. We first show that the order of B_n is a Catalan number, then we investigate the properties of a module V over B_n generated by a set of…

Representation Theory · Mathematics 2016-10-14 Jianqiang Feng , Wenli Liu , Ximei Bai , Zhenheng Li

Let ${\cal T}_n$ be the full symmetric semigroup on $X_n = \{1, 2,..., n\}$ and let ${\cal OCT}_n$ and ${\cal ORCT}_n$ be its subsemigroups of order-preserving and order-preserving or order-reversing full contraction mappings of $X_n$,…

Combinatorics · Mathematics 2013-12-09 A. D. Adeshola , A. Umar

The article contains an overview of authors achievements in development of alternative quantum-chemical approaches oriented towards revival of the classical tradition of qualitative chemical thinking instead of obtaining numerical results.…

Chemical Physics · Physics 2014-02-26 V. Gineityte

Various semigroups of noninvertible supermatrices of the special (antitriangle) shape having nilpotent Berezinian which appear in supersymmetric theories are defined and investigated. A subset of them continuously represents left and right…

funct-an · Mathematics 2008-02-03 Steven Duplij

Symmetry considerations are at the core of the major frameworks used to provide an effective mathematical representation of atomic configurations that is then used in machine-learning models to predict the properties associated with each…

Chemical Physics · Physics 2021-12-22 Jigyasa Nigam , Michael Willatt , Michele Ceriotti

We study and classify faithfully balanced modules for the algebra of lower triangular $n$ by $n$ matrices. The theory extends known results about tilting modules, which are classified by binary trees, and counted with the Catalan numbers.…

Representation Theory · Mathematics 2019-09-09 William Crawley-Boevey , Biao Ma , Baptiste Rognerud , Julia Sauter

We characterize the set of all N-ary quasigroups of order 4: every N-ary quasigroup of order 4 is permutably reducible or semilinear. Permutable reducibility means that an N-ary quasigroup can be represented as a composition of K-ary and…

Combinatorics · Mathematics 2009-02-06 Denis Krotov , Vladimir Potapov

This paper describes the synthesis of matrices with good correlation, from cyclic shifts of pseudonoise columns. Optimum matrices result whenever the shift sequence satisfies the constant difference property. Known shift sequences with the…

Discrete Mathematics · Computer Science 2007-07-13 Andrew Z Tirkel , Tom E Hall

This paper studies the combinatoric structure of the set of all representations, up to equivalence, of a finite-dimensional semisimple Lie algebra. This has intrinsic interest as a previously unsolved problem in representation theory, and…

Quantum Physics · Physics 2007-05-23 William Gordon Ritter

In this paper we consider the analytic continuation of the weighted Bergman spaces on the Lie ball $$\mathscr{D}=SO(2,n)/S(O(2) \times O(n))$$ and the corresponding holomorphic unitary (projective) representations of SO(2,n) on these…

Representation Theory · Mathematics 2009-07-02 Henrik Seppanen

We introduce two partially ordered sets, $P^A_n$ and $P^B_n$, of the same cardinalities as the type-A and type-B noncrossing partition lattices. The ground sets of $P^A_n$ and $P^B_n$ are subsets of the symmetric and the hyperoctahedral…

Combinatorics · Mathematics 2007-05-23 Miklós Bóna , Rodica Simion

Let $W^c(A_n)$ be the set of fully commutative elements in the $A_n$-type Coxeter group. Using only the settings of their canonical form, we recount $W^c(A_n)$ by the recurrence that is taken as a definition of the Catalan number $C_{n+1}$…

Combinatorics · Mathematics 2024-01-18 Sadek Al Harbat

For $n>3$, every $n\times n$ partial Cayley matrix with at most $n-1$ holes can be reconstructed by quadrangle criterion. Moreover, the holes can be filled in given order. Without additional assumptions, this is the best possible result.…

Group Theory · Mathematics 2007-05-23 Petr Vojtěchovský

We propose the variational quantum singular value decomposition based on encoding the elements of the considered { $N\times N$} matrix into the state of a quantum system of appropriate dimension. This method doesn't use the expansion of…

Quantum Physics · Physics 2025-08-05 Alexander I. Zenchuk , Wentao Qi , Junde Wu

In the present paper a new concept of representability is introduced, which can be applied to not total and also to intransitive relations (semiorders in particular). This idea tries to represent the orderings in the simplest manner,…

General Topology · Mathematics 2024-01-25 Gianni Bosi , Asier Estevan , Magali Zuanon

Matrix configurations define noncommutative spaces endowed with extra structure including a generalized Laplace operator, and hence a metric structure. Made dynamical via matrix models, they describe rich physical systems including…

High Energy Physics - Theory · Physics 2024-03-15 Laura O. Felder , Harold C. Steinacker

This is the sequel exposition following [1]. The framework quotient algebra partition is rephrased in the language of the s-representation. Thanks to this language, a quotient algebra partition of the simplest form is established under a…

Mathematical Physics · Physics 2019-12-10 Zheng-Yao Su

We study generalized regular bent functions using a representation by bent rectangles, that is, special matrices with restrictions on rows and columns. We describe affine transformations of bent rectangles, propose new biaffine and bilinear…

Combinatorics · Mathematics 2008-04-18 Sergey Agievich

We present new algorithms to compute fundamental properties of a Boolean function given in truth-table form. Specifically, we give an O(N^2.322 log N) algorithm for block sensitivity, an O(N^1.585 log N) algorithm for `tree decomposition,'…

Computational Complexity · Computer Science 2007-05-23 Scott Aaronson