Results 11 to 20 of about 309,924 (263)
Minimal Partial Ultraclones on a Two-Element Set
Известия Иркутского государственного университета: Серия "Математика", 2014 Set of functions from a finite set A to set of all subsets of A is a natural generalization of the set of many-valued functions on A (k-valued logic functions).
S.A. Badmaev, I.K. Sharankhaev
doaj +2 more sources
Parallel computation of the minimal elements of a poset [PDF]
Proceedings of the 4th International Workshop on Parallel and Symbolic Computation, 2010 Computing the minimal elements of a partially ordered finite set (poset) is a fundamental problem in combinatorics with numerous applications such as polynomial expression optimization, transversal hypergraph generation and redundant component removal, to name a few.
Leiserson, Charles E. +3 more
openaire +3 more sources
Minimal length elements of finite Coxeter groups [PDF]
Duke Mathematical Journal, 2012 19 ...
He, Xuhua, Nie, Sian
openaire +5 more sources
On Minimal Strings Containing the Elements of S_n by Decimation [PDF]
Discrete Mathematics & Theoretical Computer Science, 2001 The permutations by decimation problem is thought to be applicable to computer graphics, and raises interesting theoretical questions in combinatory theory.We present the results of some theoretical and practical investigation into this problem.We show that sequences of this form are $O(n^2)$ in length, but finding optimal solutions can be difficult.
Robert Erra, Nik Lygeros, Nigel Stewart
openaire +4 more sources
Minimal non-abelian groups with an average condition on subgroups [PDF]
Journal of Mahani Mathematical ResearchFor a finite group $G$, the average order $o(G)$ is defined to be the average of all order elements in $G$. We say that $G$ satisfies the average condition if $o(H)\leq o(G)$ for all subgroups $H$ of $G$.
Bijan Taeri, Ziba Tooshmalani
doaj +1 more source
A Study on Centralizing Monoids with Majority Operation Witnesses
Scientific Annals of Computer Science, 2023 A centralizing monoid M is a set of unary operations which commute with some set F of operations. Here, F is called a witness of M . On a 3-element set, a centralizing monoid is maximal if and only if it has a constant operation or a majority ...
Hajime Machida
doaj +1 more source
On minimal elements of upward-closed sets
Theoretical Computer Science, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yen, Hsu-Chun, Chen, Chien-Liang
openaire +3 more sources
Asymptotics for minimal overlapping patterns for generalized Euler permutations, standard tableaux of rectangular shape, and column strict arrays [PDF]
Discrete Mathematics & Theoretical Computer Science, 2016 A permutation $\tau$ in the symmetric group $S_j$ is minimally overlapping if any two consecutive occurrences of $\tau$ in a permutation $\sigma$ can share at most one element. B\'ona \cite{B} showed that the proportion of minimal overlapping patterns in
Ran Pan, Jeffrey B. Remmel
doaj +1 more source
Finite element algorithms for nonlocal minimal graphs
Mathematics in Engineering, 2021 <abstract><p>We discuss computational and qualitative aspects of the fractional Plateau and the prescribed fractional mean curvature problems on bounded domains subject to exterior data being a subgraph. We recast these problems in terms of energy minimization, and we discretize the latter with piecewise linear finite elements.
Borthagaray, Juan Pablo +2 more
openaire +4 more sources
Generic uniqueness of minimal configurations with rational rotation numbers in Aubry-Mather theory
Abstract and Applied Analysis, 2004 We study (h)-minimal configurations in Aubry-Mather theory, where h belongs to a complete metric space of functions. Such minimal configurations have definite rotation number.
Alexander J. Zaslavski
doaj +1 more source