English
Related papers

Related papers: Enumeration Order Reducibility

200 papers

In this paper new $1$-rotational 2-Steiner systems for different admissible $v,k$ pairs are introduced. In particular, $1$-rotational unitals of order $4$ are enumerated.

Combinatorics · Mathematics 2025-05-02 Ivan Hetman , Taras Banakh , Alex Ravsky

A new characterization for power function distributions is obtained which is based on products of order statistics. This result may be considered as a generalization of some recent results for contractions. We note that in this new result…

Statistics Theory · Mathematics 2012-10-30 Güvenç Arslan

Here it is shown that standard set theory can be interpreted in a theory about order. The ordering here is about non-extensional flat classes, i.e. classes that are not elements of classes. So, stipulating a nearly well order over all those…

Logic · Mathematics 2023-12-20 Zuhair Al-Johar

It has been argued that reduction procedures are closely connected to the question about identity of proofs and that accepting certain reductions would lead to a trivialization of identity of proofs in the sense that every derivation of the…

Logic in Computer Science · Computer Science 2023-10-25 Sara Ayhan

The main result of this paper is to show that all binomial identities are orderable. This is a natural statement in the combinatorial theory of finite sets, which can also be applied in distributed computing to derive new strong bounds on…

Discrete Mathematics · Computer Science 2016-06-24 Dmitry N. Kozlov

The purpose of these notes is to collect in one place some facts on the category of finite totally ordered sets and some related categories. More specifically, we collect some results on them which will be useful for the study of iteratedly…

Category Theory · Mathematics 2025-12-29 Takuo Matsuoka

We deal with the monadic (second-order) theory of order. We prove all known results in a unified way, show a general way of reduction, prove more results and show the limitation on extending them. We prove (CH) that the monadic theory of…

Logic · Mathematics 2023-05-02 Saharon Shelah

In this paper we introduce the notion of m-irreducibility that extends the standard concept of irreducibility of a numerical semigroup when the multiplicity is fixed. We analyze the structure of the set of m-irreducible numerical…

Commutative Algebra · Mathematics 2010-06-18 V. Blanco , J. C. Rosales

We study the preorder $\le_p$ on the family of subsets of an algebraically closed field of characteristic $0$ defined by letting $A\le_pB $ if there exists a polynomial $P$ such that $A=P^{-1}(B)$.

Commutative Algebra · Mathematics 2023-01-31 Riccardo Camerlo , Carla Massaza

This book dwells on mathematical and algorithmic issues of data analysis based on generality order of descriptions and respective precision. To speak of these topics correctly, we have to go some way getting acquainted with the important…

Logic in Computer Science · Computer Science 2019-08-30 Sergei O. Kuznetsov

It was shown in \cite{sc12} that for a certain class of structures $\I$, $\I$-indexed indiscernible sets have the modeling property just in case the age of $\I$ is a Ramsey class. We expand this known class of structures from ordered…

Logic · Mathematics 2016-02-10 Lynn Scow

Reproducibility is a confused terminology. In this paper, I take a fundamental view on reproducibility rooted in the scientific method. The scientific method is analysed and characterised in order to develop the terminology required to…

Machine Learning · Computer Science 2022-01-19 Odd Erik Gundersen

In this paper, we give a complete classification of irreducible bounded weight modules over the derivation Lie algebras of rational quantum tori

Representation Theory · Mathematics 2020-01-10 Genqiang Liu , Kaiming Zhao

This paper introduces a class of objects called decision rules that map infinite sequences of alternatives to a decision space. These objects can be used to model situations where a decision maker encounters alternatives in a sequence such…

Theoretical Economics · Economics 2022-09-12 Bhavook Bhardwaj , Siddharth Chatterjee

Let $n$ be a positive integer, and let $R$ be a (possibly infinite dimensional) finitely presented algebra over a computable field of characteristic zero. We describe an algorithm for deciding (in principle) whether $R$ has at most finitely…

Rings and Algebras · Mathematics 2007-05-23 Edward S. Letzter

We completely characterize definable linear orders in o-minimal structures expanding groups. For example, let (P,<_p) be a linear order definable in the real field R. Then (P,<_p) embeds definably in (R^{n+1},<_l), where <_l is the…

Logic · Mathematics 2010-11-09 Janak Ramakrishnan

A new definition for the notion of a (general) $\infty$-category is given.

Category Theory · Mathematics 2014-03-04 Daniel Gerigk

We give a new proof of the decidability of reachability in alternating pushdown systems, showing that it is a simple consequence of a cut-elimination theorem for some natural-deduction style inference systems. Then, we show how this result…

Logic in Computer Science · Computer Science 2014-10-31 Gilles Dowek , Ying Jiang

Let $(X_n,d_n),\,n\in\Bbb N$ be a sequence of pseudo-metric spaces, $p\ge 1$. For $x,y\in\prod_{n\in\Bbb N}X_n$, let $(x,y)\in E((X_n)_{n\in\Bbb N};p)\Leftrightarrow\sum_{n\in\Bbb N}d_n(x(n),y(n))^p<+\infty$. For Borel reducibility between…

Logic · Mathematics 2010-07-05 Longyun Ding

We provide an analytical framework for balanced realization model order reduction of linear control systems which depend on an unknown parameter. Besides recovering known results for the first order corrections, we obtain explicit novel…

Systems and Control · Computer Science 2016-06-24 Carles Batlle , Nestor Roqueiro