Search results for "Combinatorics"

showing 10 items of 1770 documents

A Greedy Algorithm for Hierarchical Complete Linkage Clustering

2014

We are interested in the greedy method to compute an hierarchical complete linkage clustering. There are two known methods for this problem, one having a running time of \({\mathcal O}(n^3)\) with a space requirement of \({\mathcal O}(n)\) and one having a running time of \({\mathcal O}(n^2 \log n)\) with a space requirement of Θ(n 2), where n is the number of points to be clustered. Both methods are not capable to handle large point sets. In this paper, we give an algorithm with a space requirement of \({\mathcal O}(n)\) which is able to cluster one million points in a day on current commodity hardware.

CombinatoricsCURE data clustering algorithmSUBCLUNearest-neighbor chain algorithmCorrelation clusteringSingle-linkage clusteringHierarchical clustering of networksGreedy algorithmComplete-linkage clusteringMathematics
researchProduct

Deuring’s mass formula of a Mumford family

2015

We study the Newton polygon jumping locus of a Mumford family in char p p . Our main result says that, under a mild assumption on p p , the jumping locus consists of only supersingular points and its cardinality is equal to ( p r − 1 ) ( g − 1 ) (p^r-1)(g-1) , where r r is the degree of the defining field of the base curve of a Mumford family in char p p and g g is the genus of the curve. The underlying technique is the p p -adic Hodge theory.

CombinatoricsCardinalityDegree (graph theory)Applied MathematicsGeneral MathematicsHodge theoryGenus (mathematics)Field (mathematics)Newton polygonLocus (mathematics)Base (topology)MathematicsTransactions of the American Mathematical Society
researchProduct

Cyclic and lift closures for k…21-avoiding permutations

2011

We prove that the cyclic closure of the permutation class avoiding the pattern k(k-1)...21 is finitely based. The minimal length of a minimal permutation is 2k-1 and these basis permutations are enumerated by (2k-1).c"k where c"k is the kth Catalan number. We also define lift operations and give similar results. Finally, we consider the toric closure of a class and we propose some open problems.

CombinatoricsCatalan numberDiscrete mathematicsLift (mathematics)PermutationMathematics::CombinatoricsClosure (computer programming)Discrete Mathematics and CombinatoricsTheoretical Computer ScienceCyclic permutationMathematicsDiscrete Mathematics
researchProduct

The Cauchy problem for linear growth functionals

2003

In this paper we are interested in the Cauchy problem $$ \left\{ \begin{gathered} \frac{{\partial u}}{{\partial t}} = div a (x, Du) in Q = (0,\infty ) x {\mathbb{R}^{{N }}} \hfill \\ u (0,x) = {u_{0}}(x) in x \in {\mathbb{R}^{N}}, \hfill \\ \end{gathered} \right. $$ (1.1) where \( {u_{0}} \in L_{{loc}}^{1}({\mathbb{R}^{N}}) \) and \( a(x,\xi ) = {\nabla _{\xi }}f(x,\xi ),f:{\mathbb{R}^{N}}x {\mathbb{R}^{N}} \to \mathbb{R} \)being a function with linear growth as ‖ξ‖ satisfying some additional assumptions we shall precise below. An example of function f(x, ξ) covered by our results is the nonparametric area integrand \( f(x,\xi ) = \sqrt {{1 + {{\left\| \xi \right\|}^{2}}}} \); in this case …

CombinatoricsCauchy problemCauchy's convergence testDomain (ring theory)UniquenessNabla symbolCauchy's integral theoremCauchy's integral formulaMathematicsCauchy product
researchProduct

Reduction of a Non—Linear Parabolic Initial—Boundary Value Problem to Cauchy Problem for a System of ODEs

2004

We consider the boundary value problem for a parabolic equation in the form $$\frac{{\partial {\text{u}}}}{{\partial t}} = \frac{1}{{p(x)}}\frac{\partial }{{\partial x}}\left( {p(x)f'(u)\frac{{\partial u}}{{\partial x}}} \right) + F(u),x \in (0,l),t0,$$ (1) $$u(0,x) = {u_0}(x),$$ (2) $$\frac{{\partial u}}{{\partial x}}{|_{x = 0}} = {f_1}\left( {{u_1}} \right),$$ (3) $$\frac{{\partial u}}{{\partial x}}{|_{x = 1}} = {f_2}\left( {{u_2}} \right),$$ (4) where u = u(t,x) is the unknown function, f 1, f 2, F, f are nonlinear functions and f′ (u) > 0, $${u_1} = {u_1}\left( t \right) \equiv u\left( {t,0} \right),{u_2} = {u_2}(t) \equiv u\left( {t,l} \right),f'\left( u \right) \equiv df(u)/du,p(x) \g…

CombinatoricsCauchy problemReduction (recursion theory)Mathematical analysisBoundary value problemMathematics
researchProduct

A simple algorithm to evaluate the local symmetry at each point of a closed contour

1995

In this work, contour symmetry is evaluated as a numeric feature for each point of the shape outline, using only the positions of a local vicinity of points. A measure is defined, named Local Symmetric Deficiency (LSD), so that the lower this quantity is, the higher the symmetry will be in the local region considered. This approach is simpler than related previous ones both from a conceptual point of view and for its implementation, since it is reduced just to a suitable manipulation of the Freeman chain code of the curve studied. Its computational cost is very low and it has the advantages of a parallel algorithm, since values for LSD can be computed for each point independently.

CombinatoricsChain codeLocal symmetryFeature (computer vision)Parallel algorithmPoint (geometry)Symmetry (geometry)Measure (mathematics)AlgorithmSIMPLE algorithmMathematics
researchProduct

Vertices for characters of $p$-solvable groups

2002

Suppose that G is a finite p-solvable group. We associate to every irreducible complex character X ∈ Irr(G) of G a canonical pair (Q, δ), where Q is a p-subgroup of G and δ ∈ Irr(Q), uniquely determined by X up to G-conjugacy. This pair behaves as a Green vertex and partitions Irr(G) into families of characters. Using the pair (Q, δ), we give a canonical choice of a certain p-radical subgroup R of G and a character η ∈ Irr(R) associated to X which was predicted by some conjecture of G. R. Robinson.

CombinatoricsCharacter (mathematics)ConjectureGroup (mathematics)Solvable groupApplied MathematicsGeneral MathematicsVertex (geometry)MathematicsTransactions of the American Mathematical Society
researchProduct

On the Second Order Rational Difference Equation $$x_{n+1}=\beta +\frac{1}{x_n x_{n-1}}$$ x n + 1 = β + 1 x n x n - 1

2016

The author investigates the local and global stability character, the periodic nature, and the boundedness of solutions of the second-order rational difference equation $$x_{n+1}=\beta +\frac{1}{x_{n}x_{n-1}}, \quad n=0,1,\ldots ,$$ with parameter \(\beta \) and with arbitrary initial conditions such that the denominator is always positive. The main goal of the paper is to confirm Conjecture 8.1 and to solve Open Problem 8.2 stated by A.M. Amleh, E. Camouzis and G. Ladas in On the Dynamics of a Rational Difference Equations I (International Journal of Difference Equations, Volume 3, Number 1, 2008, pp.1–35).

CombinatoricsCharacter (mathematics)ConjectureRational difference equationOpen problemMathematical analysisOrder (ring theory)Beta (velocity)Mathematics
researchProduct

VARIATIONS ON THOMPSON'S CHARACTER DEGREE THEOREM

2001

If P is a Sylow- p -subgroup of a finite p -solvable group G , we prove that G^\prime \cap \bf{N}_G(P) \subseteq {P} if and only if p divides the degree of every irreducible non-linear p -Brauer character of G. More generally if π is a set of primes containing p and G is π-separable, we give necessary and sufficient group theoretic conditions for the degree of every irreducible non-linear p -Brauer character to be divisible by some prime in π. This can also be applied to degrees of ordinary characters.

CombinatoricsCharacter (mathematics)Degree (graph theory)Group (mathematics)Solvable groupGeneral MathematicsSylow theoremsPrime (order theory)MathematicsGlasgow Mathematical Journal
researchProduct

HEIGHTS OF CHARACTERS IN BLOCKS OF $p$-SOLVABLE GROUPS

2005

In this paper, it is proved that if $B$ is a Brauer $p$ -block of a $p$ -solvable group, for some odd prime $p$ , then the height of any ordinary character in $B$ is at most $2b$ , where $p^b$ is the largest degree of the irreducible characters of the defect group of $B$ . Some other results that relate the heights of characters with properties of the defect group are obtained.

CombinatoricsCharacter (mathematics)Degree (graph theory)Solvable groupGeneral MathematicsDefect groupBlock (permutation group theory)Prime (order theory)MathematicsBulletin of the London Mathematical Society
researchProduct